%------------------------------------------------------------------------------
% File     : cvc5---1.0.5
% Problem  : ARI679_1 : TPTP v8.2.0. Released v6.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : do_cvc5 %s %d

% Computer : n026.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 : Wed May 29 16:34:29 EDT 2024

% Result   : Theorem 0.61s 0.84s
% Output   : Proof 0.61s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : ARI679_1 : TPTP v8.2.0. Released v6.3.0.
% 0.07/0.14  % Command    : do_cvc5 %s %d
% 0.14/0.36  % Computer : n026.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit   : 300
% 0.14/0.36  % WCLimit    : 300
% 0.14/0.36  % DateTime   : Mon May 27 05:14:39 EDT 2024
% 0.14/0.36  % CPUTime    : 
% 0.22/0.51  %----Proving TF0_ARI
% 0.61/0.84  --- Run --finite-model-find --decision=internal at 15...
% 0.61/0.84  % SZS status Theorem for /export/starexec/sandbox/tmp/tmp.UZtCu3i4OM/cvc5---1.0.5_14743.smt2
% 0.61/0.84  % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.UZtCu3i4OM/cvc5---1.0.5_14743.smt2
% 0.61/0.84  (assume a0 (<= 3 tptp.d))
% 0.61/0.84  (assume a1 (<= 2 tptp.c))
% 0.61/0.84  (assume a2 (not (= (<= (* 2 3) (* tptp.c tptp.d)) (<= (* 2 (- tptp.d 3)) (* tptp.c (- tptp.d 3))))))
% 0.61/0.84  (assume a3 true)
% 0.61/0.84  (step t1 (cl (not (= (or (= tptp.c 2) (or (not (>= tptp.c 2)) (>= tptp.c 3))) (or (= tptp.c 2) (not (>= tptp.c 2)) (>= tptp.c 3)))) (not (or (= tptp.c 2) (or (not (>= tptp.c 2)) (>= tptp.c 3)))) (or (= tptp.c 2) (not (>= tptp.c 2)) (>= tptp.c 3))) :rule equiv_pos2)
% 0.61/0.84  (step t2 (cl (= (or (= tptp.c 2) (or (not (>= tptp.c 2)) (>= tptp.c 3))) (or (= tptp.c 2) (not (>= tptp.c 2)) (>= tptp.c 3)))) :rule all_simplify)
% 0.61/0.84  (step t3 (cl (not (= (or (not (not (= tptp.c 2))) (not (not (< tptp.c 2))) (not (not (> tptp.c 2)))) (or (= tptp.c 2) (or (not (>= tptp.c 2)) (>= tptp.c 3))))) (not (or (not (not (= tptp.c 2))) (not (not (< tptp.c 2))) (not (not (> tptp.c 2))))) (or (= tptp.c 2) (or (not (>= tptp.c 2)) (>= tptp.c 3)))) :rule equiv_pos2)
% 0.61/0.84  (step t4 (cl (= (not (not (= tptp.c 2))) (= tptp.c 2))) :rule all_simplify)
% 0.61/0.84  (step t5 (cl (= (not (not (< tptp.c 2))) (< tptp.c 2))) :rule all_simplify)
% 0.61/0.84  (step t6 (cl (= (< tptp.c 2) (not (>= tptp.c 2)))) :rule all_simplify)
% 0.61/0.84  (step t7 (cl (= (not (not (< tptp.c 2))) (not (>= tptp.c 2)))) :rule trans :premises (t5 t6))
% 0.61/0.84  (step t8 (cl (= (not (not (> tptp.c 2))) (> tptp.c 2))) :rule all_simplify)
% 0.61/0.84  (step t9 (cl (= (> tptp.c 2) (not (<= tptp.c 2)))) :rule all_simplify)
% 0.61/0.84  (step t10 (cl (= (<= tptp.c 2) (not (>= tptp.c 3)))) :rule all_simplify)
% 0.61/0.84  (step t11 (cl (= (not (<= tptp.c 2)) (not (not (>= tptp.c 3))))) :rule cong :premises (t10))
% 0.61/0.84  (step t12 (cl (= (not (not (>= tptp.c 3))) (>= tptp.c 3))) :rule all_simplify)
% 0.61/0.84  (step t13 (cl (= (not (<= tptp.c 2)) (>= tptp.c 3))) :rule trans :premises (t11 t12))
% 0.61/0.84  (step t14 (cl (= (> tptp.c 2) (>= tptp.c 3))) :rule trans :premises (t9 t13))
% 0.61/0.84  (step t15 (cl (= (not (not (> tptp.c 2))) (>= tptp.c 3))) :rule trans :premises (t8 t14))
% 0.61/0.84  (step t16 (cl (= (or (not (not (= tptp.c 2))) (not (not (< tptp.c 2))) (not (not (> tptp.c 2)))) (or (= tptp.c 2) (not (>= tptp.c 2)) (>= tptp.c 3)))) :rule cong :premises (t4 t7 t15))
% 0.61/0.84  (step t17 (cl (= (or (= tptp.c 2) (or (not (>= tptp.c 2)) (>= tptp.c 3))) (or (= tptp.c 2) (not (>= tptp.c 2)) (>= tptp.c 3)))) :rule all_simplify)
% 0.61/0.84  (step t18 (cl (= (or (= tptp.c 2) (not (>= tptp.c 2)) (>= tptp.c 3)) (or (= tptp.c 2) (or (not (>= tptp.c 2)) (>= tptp.c 3))))) :rule symm :premises (t17))
% 0.61/0.84  (step t19 (cl (= (or (not (not (= tptp.c 2))) (not (not (< tptp.c 2))) (not (not (> tptp.c 2)))) (or (= tptp.c 2) (or (not (>= tptp.c 2)) (>= tptp.c 3))))) :rule trans :premises (t16 t18))
% 0.61/0.84  (step t20 (cl (=> (and (not (= tptp.c 2)) (not (< tptp.c 2)) (not (> tptp.c 2))) false) (and (not (= tptp.c 2)) (not (< tptp.c 2)) (not (> tptp.c 2)))) :rule implies_neg1)
% 0.61/0.84  (anchor :step t21)
% 0.61/0.84  (assume t21.a0 (not (= tptp.c 2)))
% 0.61/0.84  (assume t21.a1 (not (< tptp.c 2)))
% 0.61/0.84  (assume t21.a2 (not (> tptp.c 2)))
% 0.61/0.84  (step t21.t1 (cl (or (= tptp.c 2) (not (<= tptp.c 2)) (not (<= 2 tptp.c)))) :rule la_disequality)
% 0.61/0.84  (step t21.t2 (cl (= tptp.c 2) (not (<= tptp.c 2)) (not (<= 2 tptp.c))) :rule or :premises (t21.t1))
% 0.61/0.84  (step t21.t3 (cl (not (= (>= tptp.c 2) (<= 2 tptp.c))) (not (>= tptp.c 2)) (<= 2 tptp.c)) :rule equiv_pos2)
% 0.61/0.84  (step t21.t4 (cl (= (>= tptp.c 2) (<= 2 tptp.c))) :rule comp_simplify)
% 0.61/0.84  (step t21.t5 (cl (<= 2 tptp.c)) :rule resolution :premises (t21.t3 t21.t4 t21.a0))
% 0.61/0.84  (step t21.t6 (cl (not (<= tptp.c 2))) :rule resolution :premises (t21.t2 t21.t5 t21.a1))
% 0.61/0.84  (step t21.t7 (cl (not (= (> tptp.c 2) (not (<= tptp.c 2)))) (> tptp.c 2) (not (not (<= tptp.c 2)))) :rule equiv_pos1)
% 0.61/0.84  (step t21.t8 (cl (= (> tptp.c 2) (not (<= tptp.c 2)))) :rule comp_simplify)
% 0.61/0.84  (step t21.t9 (cl (> tptp.c 2)) :rule resolution :premises (t21.t6 t21.t7 t21.t8))
% 0.61/0.84  (step t21.t10 (cl) :rule resolution :premises (t21.t9 t21.a2))
% 0.61/0.84  (step t21 (cl (not (not (= tptp.c 2))) (not (not (< tptp.c 2))) (not (not (> tptp.c 2))) false) :rule subproof :discharge (t21.a0 t21.a1 t21.a2))
% 0.61/0.84  (step t22 (cl (not (and (not (= tptp.c 2)) (not (< tptp.c 2)) (not (> tptp.c 2)))) (not (= tptp.c 2))) :rule and_pos)
% 0.61/0.84  (step t23 (cl (not (and (not (= tptp.c 2)) (not (< tptp.c 2)) (not (> tptp.c 2)))) (not (< tptp.c 2))) :rule and_pos)
% 0.61/0.84  (step t24 (cl (not (and (not (= tptp.c 2)) (not (< tptp.c 2)) (not (> tptp.c 2)))) (not (> tptp.c 2))) :rule and_pos)
% 0.61/0.84  (step t25 (cl false (not (and (not (= tptp.c 2)) (not (< tptp.c 2)) (not (> tptp.c 2)))) (not (and (not (= tptp.c 2)) (not (< tptp.c 2)) (not (> tptp.c 2)))) (not (and (not (= tptp.c 2)) (not (< tptp.c 2)) (not (> tptp.c 2))))) :rule resolution :premises (t21 t22 t23 t24))
% 0.61/0.84  (step t26 (cl (not (and (not (= tptp.c 2)) (not (< tptp.c 2)) (not (> tptp.c 2)))) (not (and (not (= tptp.c 2)) (not (< tptp.c 2)) (not (> tptp.c 2)))) (not (and (not (= tptp.c 2)) (not (< tptp.c 2)) (not (> tptp.c 2)))) false) :rule reordering :premises (t25))
% 0.61/0.84  (step t27 (cl (not (and (not (= tptp.c 2)) (not (< tptp.c 2)) (not (> tptp.c 2)))) false) :rule contraction :premises (t26))
% 0.61/0.84  (step t28 (cl (=> (and (not (= tptp.c 2)) (not (< tptp.c 2)) (not (> tptp.c 2))) false) false) :rule resolution :premises (t20 t27))
% 0.61/0.84  (step t29 (cl (=> (and (not (= tptp.c 2)) (not (< tptp.c 2)) (not (> tptp.c 2))) false) (not false)) :rule implies_neg2)
% 0.61/0.84  (step t30 (cl (=> (and (not (= tptp.c 2)) (not (< tptp.c 2)) (not (> tptp.c 2))) false) (=> (and (not (= tptp.c 2)) (not (< tptp.c 2)) (not (> tptp.c 2))) false)) :rule resolution :premises (t28 t29))
% 0.61/0.84  (step t31 (cl (=> (and (not (= tptp.c 2)) (not (< tptp.c 2)) (not (> tptp.c 2))) false)) :rule contraction :premises (t30))
% 0.61/0.84  (step t32 (cl (= (=> (and (not (= tptp.c 2)) (not (< tptp.c 2)) (not (> tptp.c 2))) false) (not (and (not (= tptp.c 2)) (not (< tptp.c 2)) (not (> tptp.c 2)))))) :rule implies_simplify)
% 0.61/0.84  (step t33 (cl (not (=> (and (not (= tptp.c 2)) (not (< tptp.c 2)) (not (> tptp.c 2))) false)) (not (and (not (= tptp.c 2)) (not (< tptp.c 2)) (not (> tptp.c 2))))) :rule equiv1 :premises (t32))
% 0.61/0.84  (step t34 (cl (not (and (not (= tptp.c 2)) (not (< tptp.c 2)) (not (> tptp.c 2))))) :rule resolution :premises (t31 t33))
% 0.61/0.84  (step t35 (cl (not (not (= tptp.c 2))) (not (not (< tptp.c 2))) (not (not (> tptp.c 2)))) :rule not_and :premises (t34))
% 0.61/0.84  (step t36 (cl (or (not (not (= tptp.c 2))) (not (not (< tptp.c 2))) (not (not (> tptp.c 2)))) (not (not (not (= tptp.c 2))))) :rule or_neg)
% 0.61/0.84  (step t37 (cl (or (not (not (= tptp.c 2))) (not (not (< tptp.c 2))) (not (not (> tptp.c 2)))) (not (not (not (< tptp.c 2))))) :rule or_neg)
% 0.61/0.84  (step t38 (cl (or (not (not (= tptp.c 2))) (not (not (< tptp.c 2))) (not (not (> tptp.c 2)))) (not (not (not (> tptp.c 2))))) :rule or_neg)
% 0.61/0.84  (step t39 (cl (or (not (not (= tptp.c 2))) (not (not (< tptp.c 2))) (not (not (> tptp.c 2)))) (or (not (not (= tptp.c 2))) (not (not (< tptp.c 2))) (not (not (> tptp.c 2)))) (or (not (not (= tptp.c 2))) (not (not (< tptp.c 2))) (not (not (> tptp.c 2))))) :rule resolution :premises (t35 t36 t37 t38))
% 0.61/0.84  (step t40 (cl (or (not (not (= tptp.c 2))) (not (not (< tptp.c 2))) (not (not (> tptp.c 2))))) :rule contraction :premises (t39))
% 0.61/0.84  (step t41 (cl (or (= tptp.c 2) (or (not (>= tptp.c 2)) (>= tptp.c 3)))) :rule resolution :premises (t3 t19 t40))
% 0.61/0.84  (step t42 (cl (or (= tptp.c 2) (not (>= tptp.c 2)) (>= tptp.c 3))) :rule resolution :premises (t1 t2 t41))
% 0.61/0.84  (step t43 (cl (= tptp.c 2) (not (>= tptp.c 2)) (>= tptp.c 3)) :rule or :premises (t42))
% 0.61/0.84  (step t44 (cl (not (>= tptp.c 2)) (>= tptp.c 3) (= tptp.c 2)) :rule reordering :premises (t43))
% 0.61/0.84  (step t45 (cl (not (= (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) (not (= tptp.c 2))) (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1) (not (= tptp.c 2))))) (not (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) (not (= tptp.c 2)))) (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1) (not (= tptp.c 2)))) :rule equiv_pos2)
% 0.61/0.84  (step t46 (cl (= (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)))) :rule refl)
% 0.61/0.84  (step t47 (cl (= (= (= (not (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) true) (= (not (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)))) :rule equiv_simplify)
% 0.61/0.84  (step t48 (cl (not (= (= (not (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) true)) (= (not (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) :rule equiv1 :premises (t47))
% 0.61/0.84  (step t49 (cl (= (= (not (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (= (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1) (not (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)))))) :rule all_simplify)
% 0.61/0.84  (step t50 (cl (= (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1) (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) :rule refl)
% 0.61/0.84  (step t51 (cl (= (not (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) :rule all_simplify)
% 0.61/0.84  (step t52 (cl (= (= (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1) (not (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)))) (= (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1) (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)))) :rule cong :premises (t50 t51))
% 0.61/0.84  (step t53 (cl (= (= (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1) (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) true)) :rule all_simplify)
% 0.61/0.84  (step t54 (cl (= (= (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1) (not (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)))) true)) :rule trans :premises (t52 t53))
% 0.61/0.84  (step t55 (cl (= (= (not (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) true)) :rule trans :premises (t49 t54))
% 0.61/0.84  (step t56 (cl (= (not (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) :rule resolution :premises (t48 t55))
% 0.61/0.84  (step t57 (cl (= (not (= tptp.c 2)) (not (= tptp.c 2)))) :rule refl)
% 0.61/0.84  (step t58 (cl (= (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) (not (= tptp.c 2))) (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1) (not (= tptp.c 2))))) :rule cong :premises (t46 t56 t57))
% 0.61/0.84  (step t59 (cl (not (= (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 2)) (and (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.c 2))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 2))))) (not (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 2)) (and (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.c 2)))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 2)))) :rule equiv_pos2)
% 0.61/0.84  (step t60 (cl (= (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 2)) (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 2)))) :rule refl)
% 0.61/0.84  (step t61 (cl (= (= (and (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.c 2)) false) (not (and (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.c 2))))) :rule equiv_simplify)
% 0.61/0.84  (step t62 (cl (= (and (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.c 2)) false) (not (not (and (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.c 2))))) :rule equiv2 :premises (t61))
% 0.61/0.84  (step t63 (cl (not (not (not (and (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.c 2))))) (and (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.c 2))) :rule not_not)
% 0.61/0.84  (step t64 (cl (= (and (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.c 2)) false) (and (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.c 2))) :rule resolution :premises (t62 t63))
% 0.61/0.84  (step t65 (cl (=> (and (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.c 2)) false) (and (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.c 2))) :rule implies_neg1)
% 0.61/0.84  (anchor :step t66)
% 0.61/0.84  (assume t66.a0 (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)))
% 0.61/0.84  (assume t66.a1 (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))
% 0.61/0.84  (assume t66.a2 (= tptp.c 2))
% 0.61/0.84  (step t66.t1 (cl (=> (= tptp.c 2) false) (= tptp.c 2)) :rule implies_neg1)
% 0.61/0.84  (anchor :step t66.t2)
% 0.61/0.84  (assume t66.t2.a0 (= tptp.c 2))
% 0.61/0.84  (step t66.t2.t1 (cl (not (= (< (+ (* 1.0 tptp.c) (* (/ (- 1) 3) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ 1 3) (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))))) (+ (* 1.0 2) (* (/ (- 1) 3) 7) (* (/ 1 3) 1))) false)) (not (< (+ (* 1.0 tptp.c) (* (/ (- 1) 3) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ 1 3) (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))))) (+ (* 1.0 2) (* (/ (- 1) 3) 7) (* (/ 1 3) 1)))) false) :rule equiv_pos2)
% 0.61/0.84  (step t66.t2.t2 (cl (= (< (+ (* 1.0 tptp.c) (* (/ (- 1) 3) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ 1 3) (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))))) (+ (* 1.0 2) (* (/ (- 1) 3) 7) (* (/ 1 3) 1))) (not (>= (+ (* 1.0 tptp.c) (* (/ (- 1) 3) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ 1 3) (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))))) (+ (* 1.0 2) (* (/ (- 1) 3) 7) (* (/ 1 3) 1)))))) :rule all_simplify)
% 0.61/0.84  (step t66.t2.t3 (cl (= (* 1.0 tptp.c) (to_real tptp.c))) :rule all_simplify)
% 0.61/0.84  (step t66.t2.t4 (cl (= (* (/ (- 1) 3) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (+ (* (/ (- 2) 3) tptp.d) (* (- 1) tptp.c) (* (/ 1 3) (* tptp.d tptp.c))))) :rule all_simplify)
% 0.61/0.84  (step t66.t2.t5 (cl (= (* (/ 1 3) (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c)))) (+ (* (/ 2 3) tptp.d) (* (/ (- 1) 3) (* tptp.d tptp.c))))) :rule all_simplify)
% 0.61/0.84  (step t66.t2.t6 (cl (= (+ (* 1.0 tptp.c) (* (/ (- 1) 3) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ 1 3) (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))))) (+ (to_real tptp.c) (+ (* (/ (- 2) 3) tptp.d) (* (- 1) tptp.c) (* (/ 1 3) (* tptp.d tptp.c))) (+ (* (/ 2 3) tptp.d) (* (/ (- 1) 3) (* tptp.d tptp.c)))))) :rule cong :premises (t66.t2.t3 t66.t2.t4 t66.t2.t5))
% 0.61/0.84  (step t66.t2.t7 (cl (= (+ (to_real tptp.c) (+ (* (/ (- 2) 3) tptp.d) (* (- 1) tptp.c) (* (/ 1 3) (* tptp.d tptp.c))) (+ (* (/ 2 3) tptp.d) (* (/ (- 1) 3) (* tptp.d tptp.c)))) 0.0)) :rule all_simplify)
% 0.61/0.84  (step t66.t2.t8 (cl (= (+ (* 1.0 tptp.c) (* (/ (- 1) 3) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ 1 3) (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))))) 0.0)) :rule trans :premises (t66.t2.t6 t66.t2.t7))
% 0.61/0.84  (step t66.t2.t9 (cl (= (* 1.0 2) 2.0)) :rule all_simplify)
% 0.61/0.84  (step t66.t2.t10 (cl (= (* (/ (- 1) 3) 7) (/ (- 7) 3))) :rule all_simplify)
% 0.61/0.84  (step t66.t2.t11 (cl (= (* (/ 1 3) 1) (/ 1 3))) :rule all_simplify)
% 0.61/0.84  (step t66.t2.t12 (cl (= (+ (* 1.0 2) (* (/ (- 1) 3) 7) (* (/ 1 3) 1)) (+ 2.0 (/ (- 7) 3) (/ 1 3)))) :rule cong :premises (t66.t2.t9 t66.t2.t10 t66.t2.t11))
% 0.61/0.84  (step t66.t2.t13 (cl (= (+ 2.0 (/ (- 7) 3) (/ 1 3)) 0.0)) :rule all_simplify)
% 0.61/0.84  (step t66.t2.t14 (cl (= (+ (* 1.0 2) (* (/ (- 1) 3) 7) (* (/ 1 3) 1)) 0.0)) :rule trans :premises (t66.t2.t12 t66.t2.t13))
% 0.61/0.84  (step t66.t2.t15 (cl (= (>= (+ (* 1.0 tptp.c) (* (/ (- 1) 3) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ 1 3) (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))))) (+ (* 1.0 2) (* (/ (- 1) 3) 7) (* (/ 1 3) 1))) (>= 0.0 0.0))) :rule cong :premises (t66.t2.t8 t66.t2.t14))
% 0.61/0.84  (step t66.t2.t16 (cl (= (>= 0.0 0.0) true)) :rule all_simplify)
% 0.61/0.84  (step t66.t2.t17 (cl (= (>= (+ (* 1.0 tptp.c) (* (/ (- 1) 3) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ 1 3) (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))))) (+ (* 1.0 2) (* (/ (- 1) 3) 7) (* (/ 1 3) 1))) true)) :rule trans :premises (t66.t2.t15 t66.t2.t16))
% 0.61/0.84  (step t66.t2.t18 (cl (= (not (>= (+ (* 1.0 tptp.c) (* (/ (- 1) 3) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ 1 3) (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))))) (+ (* 1.0 2) (* (/ (- 1) 3) 7) (* (/ 1 3) 1)))) (not true))) :rule cong :premises (t66.t2.t17))
% 0.61/0.84  (step t66.t2.t19 (cl (= (not true) false)) :rule all_simplify)
% 0.61/0.84  (step t66.t2.t20 (cl (= (not (>= (+ (* 1.0 tptp.c) (* (/ (- 1) 3) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ 1 3) (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))))) (+ (* 1.0 2) (* (/ (- 1) 3) 7) (* (/ 1 3) 1)))) false)) :rule trans :premises (t66.t2.t18 t66.t2.t19))
% 0.61/0.84  (step t66.t2.t21 (cl (= (< (+ (* 1.0 tptp.c) (* (/ (- 1) 3) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ 1 3) (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))))) (+ (* 1.0 2) (* (/ (- 1) 3) 7) (* (/ 1 3) 1))) false)) :rule trans :premises (t66.t2.t2 t66.t2.t20))
% 0.61/0.84  (step t66.t2.t22 (cl (not (= (* 1.0 tptp.c) (* 1.0 2))) (not (<= (* (/ (- 1) 3) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ (- 1) 3) 7))) (not (< (* (/ 1 3) (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c)))) (* (/ 1 3) 1))) (< (+ (* 1.0 tptp.c) (* (/ (- 1) 3) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ 1 3) (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))))) (+ (* 1.0 2) (* (/ (- 1) 3) 7) (* (/ 1 3) 1)))) :rule la_generic :args ((- 1) 1 1 1))
% 0.61/0.84  (step t66.t2.t23 (cl (=> (and (> 1.0 0) (= tptp.c 2)) (= (* 1.0 tptp.c) (* 1.0 2)))) :rule la_mult_pos)
% 0.61/0.84  (step t66.t2.t24 (cl (not (and (> 1.0 0) (= tptp.c 2))) (= (* 1.0 tptp.c) (* 1.0 2))) :rule implies :premises (t66.t2.t23))
% 0.61/0.84  (step t66.t2.t25 (cl (and (> 1.0 0) (= tptp.c 2)) (not (> 1.0 0)) (not (= tptp.c 2))) :rule and_neg)
% 0.61/0.84  (step t66.t2.t26 (cl (= (= (> 1.0 0) true) (> 1.0 0))) :rule equiv_simplify)
% 0.61/0.84  (step t66.t2.t27 (cl (not (= (> 1.0 0) true)) (> 1.0 0)) :rule equiv1 :premises (t66.t2.t26))
% 0.61/0.84  (step t66.t2.t28 (cl (= (> 1.0 0) true)) :rule hole :args ((> 1.0 0)))
% 0.61/0.84  (step t66.t2.t29 (cl (> 1.0 0)) :rule resolution :premises (t66.t2.t27 t66.t2.t28))
% 0.61/0.84  (step t66.t2.t30 (cl (and (> 1.0 0) (= tptp.c 2))) :rule resolution :premises (t66.t2.t25 t66.t2.t29 t66.t2.a0))
% 0.61/0.84  (step t66.t2.t31 (cl (= (* 1.0 tptp.c) (* 1.0 2))) :rule resolution :premises (t66.t2.t24 t66.t2.t30))
% 0.61/0.84  (step t66.t2.t32 (cl (=> (and (< (/ (- 1) 3) 0) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (<= (* (/ (- 1) 3) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ (- 1) 3) 7)))) :rule la_mult_neg)
% 0.61/0.84  (step t66.t2.t33 (cl (not (and (< (/ (- 1) 3) 0) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (<= (* (/ (- 1) 3) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ (- 1) 3) 7))) :rule implies :premises (t66.t2.t32))
% 0.61/0.84  (step t66.t2.t34 (cl (and (< (/ (- 1) 3) 0) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (< (/ (- 1) 3) 0)) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule and_neg)
% 0.61/0.84  (step t66.t2.t35 (cl (= (= (< (/ (- 1) 3) 0) true) (< (/ (- 1) 3) 0))) :rule equiv_simplify)
% 0.61/0.84  (step t66.t2.t36 (cl (not (= (< (/ (- 1) 3) 0) true)) (< (/ (- 1) 3) 0)) :rule equiv1 :premises (t66.t2.t35))
% 0.61/0.84  (step t66.t2.t37 (cl (= (< (/ (- 1) 3) 0) true)) :rule hole :args ((< (/ (- 1) 3) 0)))
% 0.61/0.84  (step t66.t2.t38 (cl (< (/ (- 1) 3) 0)) :rule resolution :premises (t66.t2.t36 t66.t2.t37))
% 0.61/0.84  (step t66.t2.t39 (cl (and (< (/ (- 1) 3) 0) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule resolution :premises (t66.t2.t34 t66.t2.t38 t66.a1))
% 0.61/0.84  (step t66.t2.t40 (cl (<= (* (/ (- 1) 3) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ (- 1) 3) 7))) :rule resolution :premises (t66.t2.t33 t66.t2.t39))
% 0.61/0.84  (step t66.t2.t41 (cl (=> (and (> (/ 1 3) 0) (< (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (< (* (/ 1 3) (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c)))) (* (/ 1 3) 1)))) :rule la_mult_pos)
% 0.61/0.84  (step t66.t2.t42 (cl (not (and (> (/ 1 3) 0) (< (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) (< (* (/ 1 3) (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c)))) (* (/ 1 3) 1))) :rule implies :premises (t66.t2.t41))
% 0.61/0.84  (step t66.t2.t43 (cl (and (> (/ 1 3) 0) (< (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (> (/ 1 3) 0)) (not (< (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) :rule and_neg)
% 0.61/0.84  (step t66.t2.t44 (cl (= (= (> (/ 1 3) 0) true) (> (/ 1 3) 0))) :rule equiv_simplify)
% 0.61/0.84  (step t66.t2.t45 (cl (not (= (> (/ 1 3) 0) true)) (> (/ 1 3) 0)) :rule equiv1 :premises (t66.t2.t44))
% 0.61/0.84  (step t66.t2.t46 (cl (= (> (/ 1 3) 0) true)) :rule hole :args ((> (/ 1 3) 0)))
% 0.61/0.84  (step t66.t2.t47 (cl (> (/ 1 3) 0)) :rule resolution :premises (t66.t2.t45 t66.t2.t46))
% 0.61/0.84  (step t66.t2.t48 (cl (not (= (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (< (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) (not (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) (< (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) :rule equiv_pos2)
% 0.61/0.84  (step t66.t2.t49 (cl (= (< (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1) (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)))) :rule all_simplify)
% 0.61/0.84  (step t66.t2.t50 (cl (= (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (< (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) :rule symm :premises (t66.t2.t49))
% 0.61/0.84  (step t66.t2.t51 (cl (< (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) :rule resolution :premises (t66.t2.t48 t66.t2.t50 t66.a0))
% 0.61/0.84  (step t66.t2.t52 (cl (and (> (/ 1 3) 0) (< (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) :rule resolution :premises (t66.t2.t43 t66.t2.t47 t66.t2.t51))
% 0.61/0.84  (step t66.t2.t53 (cl (< (* (/ 1 3) (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c)))) (* (/ 1 3) 1))) :rule resolution :premises (t66.t2.t42 t66.t2.t52))
% 0.61/0.84  (step t66.t2.t54 (cl (< (+ (* 1.0 tptp.c) (* (/ (- 1) 3) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ 1 3) (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))))) (+ (* 1.0 2) (* (/ (- 1) 3) 7) (* (/ 1 3) 1)))) :rule resolution :premises (t66.t2.t22 t66.t2.t31 t66.t2.t40 t66.t2.t53))
% 0.61/0.84  (step t66.t2.t55 (cl false) :rule resolution :premises (t66.t2.t1 t66.t2.t21 t66.t2.t54))
% 0.61/0.84  (step t66.t2 (cl (not (= tptp.c 2)) false) :rule subproof :discharge (t66.t2.a0))
% 0.61/0.84  (step t66.t3 (cl (=> (= tptp.c 2) false) false) :rule resolution :premises (t66.t1 t66.t2))
% 0.61/0.84  (step t66.t4 (cl (=> (= tptp.c 2) false) (not false)) :rule implies_neg2)
% 0.61/0.84  (step t66.t5 (cl (=> (= tptp.c 2) false) (=> (= tptp.c 2) false)) :rule resolution :premises (t66.t3 t66.t4))
% 0.61/0.84  (step t66.t6 (cl (=> (= tptp.c 2) false)) :rule contraction :premises (t66.t5))
% 0.61/0.84  (step t66.t7 (cl (= (=> (= tptp.c 2) false) (not (= tptp.c 2)))) :rule implies_simplify)
% 0.61/0.84  (step t66.t8 (cl (not (=> (= tptp.c 2) false)) (not (= tptp.c 2))) :rule equiv1 :premises (t66.t7))
% 0.61/0.84  (step t66.t9 (cl (not (= tptp.c 2))) :rule resolution :premises (t66.t6 t66.t8))
% 0.61/0.84  (step t66.t10 (cl) :rule resolution :premises (t66.a2 t66.t9))
% 0.61/0.84  (step t66 (cl (not (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (= tptp.c 2)) false) :rule subproof :discharge (t66.a0 t66.a1 t66.a2))
% 0.61/0.84  (step t67 (cl (not (and (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.c 2))) (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) :rule and_pos)
% 0.61/0.84  (step t68 (cl (not (and (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.c 2))) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) :rule and_pos)
% 0.61/0.84  (step t69 (cl (not (and (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.c 2))) (= tptp.c 2)) :rule and_pos)
% 0.61/0.84  (step t70 (cl false (not (and (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.c 2))) (not (and (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.c 2))) (not (and (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.c 2)))) :rule resolution :premises (t66 t67 t68 t69))
% 0.61/0.84  (step t71 (cl (not (and (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.c 2))) (not (and (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.c 2))) (not (and (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.c 2))) false) :rule reordering :premises (t70))
% 0.61/0.84  (step t72 (cl (not (and (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.c 2))) false) :rule contraction :premises (t71))
% 0.61/0.84  (step t73 (cl (=> (and (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.c 2)) false) false) :rule resolution :premises (t65 t72))
% 0.61/0.84  (step t74 (cl (=> (and (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.c 2)) false) (not false)) :rule implies_neg2)
% 0.61/0.84  (step t75 (cl (=> (and (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.c 2)) false) (=> (and (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.c 2)) false)) :rule resolution :premises (t73 t74))
% 0.61/0.84  (step t76 (cl (=> (and (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.c 2)) false)) :rule contraction :premises (t75))
% 0.61/0.84  (step t77 (cl (= (=> (and (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.c 2)) false) (not (and (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.c 2))))) :rule implies_simplify)
% 0.61/0.84  (step t78 (cl (not (=> (and (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.c 2)) false)) (not (and (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.c 2)))) :rule equiv1 :premises (t77))
% 0.61/0.84  (step t79 (cl (not (and (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.c 2)))) :rule resolution :premises (t76 t78))
% 0.61/0.84  (step t80 (cl (= (and (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.c 2)) false)) :rule resolution :premises (t64 t79))
% 0.61/0.84  (step t81 (cl (= (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 2)) (and (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.c 2))) (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 2)) false))) :rule cong :premises (t60 t80))
% 0.61/0.84  (step t82 (cl (= (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 2)) false) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 2))))) :rule all_simplify)
% 0.61/0.84  (step t83 (cl (= (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 2)) (and (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.c 2))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 2))))) :rule trans :premises (t81 t82))
% 0.61/0.84  (step t84 (cl (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 2)) (and (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.c 2))) (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 2))) :rule implies_neg1)
% 0.61/0.84  (anchor :step t85)
% 0.61/0.84  (assume t85.a0 (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))
% 0.61/0.84  (assume t85.a1 (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)))
% 0.61/0.84  (assume t85.a2 (= tptp.c 2))
% 0.61/0.84  (step t85.t1 (cl (and (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.c 2)) (not (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (= tptp.c 2))) :rule and_neg)
% 0.61/0.84  (step t85.t2 (cl (and (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.c 2))) :rule resolution :premises (t85.t1 t85.a1 t85.a0 t85.a2))
% 0.61/0.84  (step t85 (cl (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) (not (= tptp.c 2)) (and (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.c 2))) :rule subproof :discharge (t85.a0 t85.a1 t85.a2))
% 0.61/0.84  (step t86 (cl (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 2))) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) :rule and_pos)
% 0.61/0.84  (step t87 (cl (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 2))) (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) :rule and_pos)
% 0.61/0.84  (step t88 (cl (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 2))) (= tptp.c 2)) :rule and_pos)
% 0.61/0.84  (step t89 (cl (and (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.c 2)) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 2))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 2))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 2)))) :rule resolution :premises (t85 t86 t87 t88))
% 0.61/0.84  (step t90 (cl (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 2))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 2))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 2))) (and (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.c 2))) :rule reordering :premises (t89))
% 0.61/0.84  (step t91 (cl (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 2))) (and (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.c 2))) :rule contraction :premises (t90))
% 0.61/0.84  (step t92 (cl (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 2)) (and (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.c 2))) (and (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.c 2))) :rule resolution :premises (t84 t91))
% 0.61/0.84  (step t93 (cl (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 2)) (and (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.c 2))) (not (and (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.c 2)))) :rule implies_neg2)
% 0.61/0.84  (step t94 (cl (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 2)) (and (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.c 2))) (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 2)) (and (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.c 2)))) :rule resolution :premises (t92 t93))
% 0.61/0.84  (step t95 (cl (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 2)) (and (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.c 2)))) :rule contraction :premises (t94))
% 0.61/0.84  (step t96 (cl (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 2)))) :rule resolution :premises (t59 t83 t95))
% 0.61/0.84  (step t97 (cl (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) (not (= tptp.c 2))) :rule not_and :premises (t96))
% 0.61/0.84  (step t98 (cl (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) (not (= tptp.c 2))) (not (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)))) :rule or_neg)
% 0.61/0.84  (step t99 (cl (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) (not (= tptp.c 2))) (not (not (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))))) :rule or_neg)
% 0.61/0.84  (step t100 (cl (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) (not (= tptp.c 2))) (not (not (= tptp.c 2)))) :rule or_neg)
% 0.61/0.84  (step t101 (cl (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) (not (= tptp.c 2))) (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) (not (= tptp.c 2))) (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) (not (= tptp.c 2)))) :rule resolution :premises (t97 t98 t99 t100))
% 0.61/0.84  (step t102 (cl (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) (not (= tptp.c 2)))) :rule contraction :premises (t101))
% 0.61/0.84  (step t103 (cl (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1) (not (= tptp.c 2)))) :rule resolution :premises (t45 t58 t102))
% 0.61/0.84  (step t104 (cl (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1) (not (= tptp.c 2))) :rule or :premises (t103))
% 0.61/0.84  (step t105 (cl (not (= (or (not (>= (* tptp.d tptp.c) 6)) (not (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)))) (or (not (>= (* tptp.d tptp.c) 6)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)))) (not (or (not (>= (* tptp.d tptp.c) 6)) (not (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))))) (or (not (>= (* tptp.d tptp.c) 6)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule equiv_pos2)
% 0.61/0.84  (step t106 (cl (= (not (>= (* tptp.d tptp.c) 6)) (not (>= (* tptp.d tptp.c) 6)))) :rule refl)
% 0.61/0.84  (step t107 (cl (= (= (= (not (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) true) (= (not (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)))) :rule equiv_simplify)
% 0.61/0.84  (step t108 (cl (not (= (= (not (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) true)) (= (not (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule equiv1 :premises (t107))
% 0.61/0.84  (step t109 (cl (= (= (not (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (= (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)))))) :rule all_simplify)
% 0.61/0.84  (step t110 (cl (= (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule refl)
% 0.61/0.84  (step t111 (cl (= (not (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule all_simplify)
% 0.61/0.84  (step t112 (cl (= (= (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)))) (= (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)))) :rule cong :premises (t110 t111))
% 0.61/0.84  (step t113 (cl (= (= (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) true)) :rule all_simplify)
% 0.61/0.84  (step t114 (cl (= (= (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)))) true)) :rule trans :premises (t112 t113))
% 0.61/0.84  (step t115 (cl (= (= (not (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) true)) :rule trans :premises (t109 t114))
% 0.61/0.84  (step t116 (cl (= (not (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule resolution :premises (t108 t115))
% 0.61/0.84  (step t117 (cl (= (or (not (>= (* tptp.d tptp.c) 6)) (not (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)))) (or (not (>= (* tptp.d tptp.c) 6)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)))) :rule cong :premises (t106 t116))
% 0.61/0.84  (step t118 (cl (not (= (not (= (<= (* 2 3) (* tptp.c tptp.d)) (<= (* 2 (- tptp.d 3)) (* tptp.c (- tptp.d 3))))) (not (= (>= (* tptp.d tptp.c) 6) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)))))) (not (not (= (<= (* 2 3) (* tptp.c tptp.d)) (<= (* 2 (- tptp.d 3)) (* tptp.c (- tptp.d 3)))))) (not (= (>= (* tptp.d tptp.c) 6) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))))) :rule equiv_pos2)
% 0.61/0.84  (step t119 (cl (= (* 2 3) 6)) :rule all_simplify)
% 0.61/0.84  (step t120 (cl (= (* tptp.c tptp.d) (* tptp.d tptp.c))) :rule all_simplify)
% 0.61/0.84  (step t121 (cl (= (<= (* 2 3) (* tptp.c tptp.d)) (<= 6 (* tptp.d tptp.c)))) :rule cong :premises (t119 t120))
% 0.61/0.84  (step t122 (cl (= (<= 6 (* tptp.d tptp.c)) (>= (* tptp.d tptp.c) 6))) :rule all_simplify)
% 0.61/0.84  (step t123 (cl (= (<= (* 2 3) (* tptp.c tptp.d)) (>= (* tptp.d tptp.c) 6))) :rule trans :premises (t121 t122))
% 0.61/0.84  (step t124 (cl (= 2 2)) :rule refl)
% 0.61/0.84  (step t125 (cl (= (- tptp.d 3) (+ tptp.d (* (- 1) 3)))) :rule all_simplify)
% 0.61/0.84  (step t126 (cl (= tptp.d tptp.d)) :rule refl)
% 0.61/0.84  (step t127 (cl (= (* (- 1) 3) (- 3))) :rule all_simplify)
% 0.61/0.84  (step t128 (cl (= (+ tptp.d (* (- 1) 3)) (+ tptp.d (- 3)))) :rule cong :premises (t126 t127))
% 0.61/0.84  (step t129 (cl (= (+ tptp.d (- 3)) (+ (- 3) tptp.d))) :rule all_simplify)
% 0.61/0.84  (step t130 (cl (= (+ tptp.d (* (- 1) 3)) (+ (- 3) tptp.d))) :rule trans :premises (t128 t129))
% 0.61/0.84  (step t131 (cl (= (- tptp.d 3) (+ (- 3) tptp.d))) :rule trans :premises (t125 t130))
% 0.61/0.84  (step t132 (cl (= (* 2 (- tptp.d 3)) (* 2 (+ (- 3) tptp.d)))) :rule cong :premises (t124 t131))
% 0.61/0.84  (step t133 (cl (= (* 2 (+ (- 3) tptp.d)) (+ (- 6) (* 2 tptp.d)))) :rule all_simplify)
% 0.61/0.84  (step t134 (cl (= (* 2 (- tptp.d 3)) (+ (- 6) (* 2 tptp.d)))) :rule trans :premises (t132 t133))
% 0.61/0.84  (step t135 (cl (= tptp.c tptp.c)) :rule refl)
% 0.61/0.84  (step t136 (cl (= (* tptp.c (- tptp.d 3)) (* tptp.c (+ (- 3) tptp.d)))) :rule cong :premises (t135 t131))
% 0.61/0.84  (step t137 (cl (= (* tptp.c (+ (- 3) tptp.d)) (+ (* (- 3) tptp.c) (* tptp.d tptp.c)))) :rule all_simplify)
% 0.61/0.84  (step t138 (cl (= (* tptp.c (- tptp.d 3)) (+ (* (- 3) tptp.c) (* tptp.d tptp.c)))) :rule trans :premises (t136 t137))
% 0.61/0.84  (step t139 (cl (= (<= (* 2 (- tptp.d 3)) (* tptp.c (- tptp.d 3))) (<= (+ (- 6) (* 2 tptp.d)) (+ (* (- 3) tptp.c) (* tptp.d tptp.c))))) :rule cong :premises (t134 t138))
% 0.61/0.84  (step t140 (cl (= (<= (+ (- 6) (* 2 tptp.d)) (+ (* (- 3) tptp.c) (* tptp.d tptp.c))) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)))) :rule all_simplify)
% 0.61/0.84  (step t141 (cl (= (<= (* 2 (- tptp.d 3)) (* tptp.c (- tptp.d 3))) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)))) :rule trans :premises (t139 t140))
% 0.61/0.84  (step t142 (cl (= (= (<= (* 2 3) (* tptp.c tptp.d)) (<= (* 2 (- tptp.d 3)) (* tptp.c (- tptp.d 3)))) (= (>= (* tptp.d tptp.c) 6) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))))) :rule cong :premises (t123 t141))
% 0.61/0.84  (step t143 (cl (= (not (= (<= (* 2 3) (* tptp.c tptp.d)) (<= (* 2 (- tptp.d 3)) (* tptp.c (- tptp.d 3))))) (not (= (>= (* tptp.d tptp.c) 6) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)))))) :rule cong :premises (t142))
% 0.61/0.84  (step t144 (cl (not (= (>= (* tptp.d tptp.c) 6) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))))) :rule resolution :premises (t118 t143 a2))
% 0.61/0.84  (step t145 (cl (not (>= (* tptp.d tptp.c) 6)) (not (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)))) :rule not_equiv2 :premises (t144))
% 0.61/0.84  (step t146 (cl (or (not (>= (* tptp.d tptp.c) 6)) (not (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)))) (not (not (>= (* tptp.d tptp.c) 6)))) :rule or_neg)
% 0.61/0.84  (step t147 (cl (or (not (>= (* tptp.d tptp.c) 6)) (not (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)))) (not (not (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))))) :rule or_neg)
% 0.61/0.84  (step t148 (cl (or (not (>= (* tptp.d tptp.c) 6)) (not (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)))) (or (not (>= (* tptp.d tptp.c) 6)) (not (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))))) :rule resolution :premises (t145 t146 t147))
% 0.61/0.84  (step t149 (cl (or (not (>= (* tptp.d tptp.c) 6)) (not (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))))) :rule contraction :premises (t148))
% 0.61/0.84  (step t150 (cl (or (not (>= (* tptp.d tptp.c) 6)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule resolution :premises (t105 t117 t149))
% 0.61/0.84  (step t151 (cl (not (>= (* tptp.d tptp.c) 6)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) :rule or :premises (t150))
% 0.61/0.84  (step t152 (cl (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (* tptp.d tptp.c) 6))) :rule reordering :premises (t151))
% 0.61/0.84  (step t153 (cl (not (= (or (not (>= tptp.d 3)) (not (>= tptp.c 2)) (not (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (not (not (>= (* tptp.d tptp.c) 6)))) (or (not (>= tptp.d 3)) (not (>= tptp.c 2)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (>= (* tptp.d tptp.c) 6)))) (not (or (not (>= tptp.d 3)) (not (>= tptp.c 2)) (not (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (not (not (>= (* tptp.d tptp.c) 6))))) (or (not (>= tptp.d 3)) (not (>= tptp.c 2)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (>= (* tptp.d tptp.c) 6))) :rule equiv_pos2)
% 0.61/0.84  (step t154 (cl (= (not (>= tptp.d 3)) (not (>= tptp.d 3)))) :rule refl)
% 0.61/0.84  (step t155 (cl (= (not (>= tptp.c 2)) (not (>= tptp.c 2)))) :rule refl)
% 0.61/0.84  (step t156 (cl (= (= (= (not (not (>= (* tptp.d tptp.c) 6))) (>= (* tptp.d tptp.c) 6)) true) (= (not (not (>= (* tptp.d tptp.c) 6))) (>= (* tptp.d tptp.c) 6)))) :rule equiv_simplify)
% 0.61/0.84  (step t157 (cl (not (= (= (not (not (>= (* tptp.d tptp.c) 6))) (>= (* tptp.d tptp.c) 6)) true)) (= (not (not (>= (* tptp.d tptp.c) 6))) (>= (* tptp.d tptp.c) 6))) :rule equiv1 :premises (t156))
% 0.61/0.84  (step t158 (cl (= (= (not (not (>= (* tptp.d tptp.c) 6))) (>= (* tptp.d tptp.c) 6)) (= (>= (* tptp.d tptp.c) 6) (not (not (>= (* tptp.d tptp.c) 6)))))) :rule all_simplify)
% 0.61/0.84  (step t159 (cl (= (>= (* tptp.d tptp.c) 6) (>= (* tptp.d tptp.c) 6))) :rule refl)
% 0.61/0.84  (step t160 (cl (= (not (not (>= (* tptp.d tptp.c) 6))) (>= (* tptp.d tptp.c) 6))) :rule all_simplify)
% 0.61/0.84  (step t161 (cl (= (= (>= (* tptp.d tptp.c) 6) (not (not (>= (* tptp.d tptp.c) 6)))) (= (>= (* tptp.d tptp.c) 6) (>= (* tptp.d tptp.c) 6)))) :rule cong :premises (t159 t160))
% 0.61/0.84  (step t162 (cl (= (= (>= (* tptp.d tptp.c) 6) (>= (* tptp.d tptp.c) 6)) true)) :rule all_simplify)
% 0.61/0.84  (step t163 (cl (= (= (>= (* tptp.d tptp.c) 6) (not (not (>= (* tptp.d tptp.c) 6)))) true)) :rule trans :premises (t161 t162))
% 0.61/0.84  (step t164 (cl (= (= (not (not (>= (* tptp.d tptp.c) 6))) (>= (* tptp.d tptp.c) 6)) true)) :rule trans :premises (t158 t163))
% 0.61/0.84  (step t165 (cl (= (not (not (>= (* tptp.d tptp.c) 6))) (>= (* tptp.d tptp.c) 6))) :rule resolution :premises (t157 t164))
% 0.61/0.84  (step t166 (cl (= (or (not (>= tptp.d 3)) (not (>= tptp.c 2)) (not (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (not (not (>= (* tptp.d tptp.c) 6)))) (or (not (>= tptp.d 3)) (not (>= tptp.c 2)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (>= (* tptp.d tptp.c) 6)))) :rule cong :premises (t154 t155 t116 t165))
% 0.61/0.84  (step t167 (cl (=> (and (>= tptp.d 3) (>= tptp.c 2) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (>= (* tptp.d tptp.c) 6))) false) (and (>= tptp.d 3) (>= tptp.c 2) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (>= (* tptp.d tptp.c) 6)))) :rule implies_neg1)
% 0.61/0.84  (anchor :step t168)
% 0.61/0.84  (assume t168.a0 (>= tptp.d 3))
% 0.61/0.84  (assume t168.a1 (>= tptp.c 2))
% 0.61/0.84  (assume t168.a2 (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)))
% 0.61/0.84  (assume t168.a3 (not (>= (* tptp.d tptp.c) 6)))
% 0.61/0.84  (step t168.t1 (cl (not (< (* tptp.d tptp.c) 6)) (<= (* tptp.d tptp.c) 5)) :rule la_generic :args (1 1))
% 0.61/0.84  (step t168.t2 (cl (not (= (not (>= (* tptp.d tptp.c) 6)) (< (* tptp.d tptp.c) 6))) (not (not (>= (* tptp.d tptp.c) 6))) (< (* tptp.d tptp.c) 6)) :rule equiv_pos2)
% 0.61/0.84  (step t168.t3 (cl (= (< (* tptp.d tptp.c) 6) (not (>= (* tptp.d tptp.c) 6)))) :rule all_simplify)
% 0.61/0.84  (step t168.t4 (cl (= (not (>= (* tptp.d tptp.c) 6)) (< (* tptp.d tptp.c) 6))) :rule symm :premises (t168.t3))
% 0.61/0.84  (step t168.t5 (cl (< (* tptp.d tptp.c) 6)) :rule resolution :premises (t168.t2 t168.t4 t168.a3))
% 0.61/0.84  (step t168.t6 (cl (<= (* tptp.d tptp.c) 5)) :rule resolution :premises (t168.t1 t168.t5))
% 0.61/0.84  (step t168.t7 (cl (not (= (> (* tptp.d tptp.c) 5) (not (<= (* tptp.d tptp.c) 5)))) (not (> (* tptp.d tptp.c) 5)) (not (<= (* tptp.d tptp.c) 5))) :rule equiv_pos2)
% 0.61/0.84  (step t168.t8 (cl (= (> (* tptp.d tptp.c) 5) (not (<= (* tptp.d tptp.c) 5)))) :rule all_simplify)
% 0.61/0.84  (step t168.t9 (cl (= (<= (* tptp.d tptp.c) 5) (not (>= (* tptp.d tptp.c) 6)))) :rule all_simplify)
% 0.61/0.84  (step t168.t10 (cl (= (not (<= (* tptp.d tptp.c) 5)) (not (not (>= (* tptp.d tptp.c) 6))))) :rule cong :premises (t168.t9))
% 0.61/0.84  (step t168.t11 (cl (= (not (<= (* tptp.d tptp.c) 5)) (>= (* tptp.d tptp.c) 6))) :rule trans :premises (t168.t10 t160))
% 0.61/0.84  (step t168.t12 (cl (= (> (* tptp.d tptp.c) 5) (>= (* tptp.d tptp.c) 6))) :rule trans :premises (t168.t8 t168.t11))
% 0.61/0.84  (step t168.t13 (cl (= (>= (* tptp.d tptp.c) 6) (not (<= (* tptp.d tptp.c) 5)))) :rule symm :premises (t168.t11))
% 0.61/0.84  (step t168.t14 (cl (= (> (* tptp.d tptp.c) 5) (not (<= (* tptp.d tptp.c) 5)))) :rule trans :premises (t168.t12 t168.t13))
% 0.61/0.84  (step t168.t15 (cl (not (= (not (<= (* tptp.d tptp.c) 5)) (> (* tptp.d tptp.c) 5))) (not (not (<= (* tptp.d tptp.c) 5))) (> (* tptp.d tptp.c) 5)) :rule equiv_pos2)
% 0.61/0.84  (step t168.t16 (cl (= (>= (* tptp.d tptp.c) 6) (> (* tptp.d tptp.c) 5))) :rule symm :premises (t168.t12))
% 0.61/0.84  (step t168.t17 (cl (= (not (<= (* tptp.d tptp.c) 5)) (> (* tptp.d tptp.c) 5))) :rule trans :premises (t168.t11 t168.t16))
% 0.61/0.84  (step t168.t18 (cl (=> (<= (* tptp.d tptp.c) 5) false) (<= (* tptp.d tptp.c) 5)) :rule implies_neg1)
% 0.61/0.84  (anchor :step t168.t19)
% 0.61/0.84  (assume t168.t19.a0 (<= (* tptp.d tptp.c) 5))
% 0.61/0.84  (step t168.t19.t1 (cl (not (= (< (+ (* 1.0 (* tptp.d tptp.c)) (* 1.0 (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 3.0) tptp.c) (* (- 2.0) tptp.d)) (+ (* 1.0 5) (* 1.0 7) (* (- 3.0) 2) (* (- 2.0) 3))) false)) (not (< (+ (* 1.0 (* tptp.d tptp.c)) (* 1.0 (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 3.0) tptp.c) (* (- 2.0) tptp.d)) (+ (* 1.0 5) (* 1.0 7) (* (- 3.0) 2) (* (- 2.0) 3)))) false) :rule equiv_pos2)
% 0.61/0.84  (step t168.t19.t2 (cl (= (< (+ (* 1.0 (* tptp.d tptp.c)) (* 1.0 (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 3.0) tptp.c) (* (- 2.0) tptp.d)) (+ (* 1.0 5) (* 1.0 7) (* (- 3.0) 2) (* (- 2.0) 3))) (not (>= (+ (* 1.0 (* tptp.d tptp.c)) (* 1.0 (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 3.0) tptp.c) (* (- 2.0) tptp.d)) (+ (* 1.0 5) (* 1.0 7) (* (- 3.0) 2) (* (- 2.0) 3)))))) :rule all_simplify)
% 0.61/0.84  (step t168.t19.t3 (cl (= (* 1.0 (* tptp.d tptp.c)) (to_real (* tptp.d tptp.c)))) :rule all_simplify)
% 0.61/0.84  (step t168.t19.t4 (cl (= (* 1.0 (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (to_real (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))))) :rule all_simplify)
% 0.61/0.84  (step t168.t19.t5 (cl (= (* (- 3.0) tptp.c) (to_real (* (- 3) tptp.c)))) :rule all_simplify)
% 0.61/0.84  (step t168.t19.t6 (cl (= (* (- 2.0) tptp.d) (to_real (* (- 2) tptp.d)))) :rule all_simplify)
% 0.61/0.84  (step t168.t19.t7 (cl (= (+ (* 1.0 (* tptp.d tptp.c)) (* 1.0 (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 3.0) tptp.c) (* (- 2.0) tptp.d)) (+ (to_real (* tptp.d tptp.c)) (to_real (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (to_real (* (- 3) tptp.c)) (to_real (* (- 2) tptp.d))))) :rule cong :premises (t168.t19.t3 t168.t19.t4 t168.t19.t5 t168.t19.t6))
% 0.61/0.84  (step t168.t19.t8 (cl (= (+ (to_real (* tptp.d tptp.c)) (to_real (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (to_real (* (- 3) tptp.c)) (to_real (* (- 2) tptp.d))) 0.0)) :rule all_simplify)
% 0.61/0.84  (step t168.t19.t9 (cl (= (+ (* 1.0 (* tptp.d tptp.c)) (* 1.0 (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 3.0) tptp.c) (* (- 2.0) tptp.d)) 0.0)) :rule trans :premises (t168.t19.t7 t168.t19.t8))
% 0.61/0.84  (step t168.t19.t10 (cl (= (* 1.0 5) 5.0)) :rule all_simplify)
% 0.61/0.84  (step t168.t19.t11 (cl (= (* 1.0 7) 7.0)) :rule all_simplify)
% 0.61/0.84  (step t168.t19.t12 (cl (= (* (- 3.0) 2) (- 6.0))) :rule all_simplify)
% 0.61/0.84  (step t168.t19.t13 (cl (= (* (- 2.0) 3) (- 6.0))) :rule all_simplify)
% 0.61/0.84  (step t168.t19.t14 (cl (= (+ (* 1.0 5) (* 1.0 7) (* (- 3.0) 2) (* (- 2.0) 3)) (+ 5.0 7.0 (- 6.0) (- 6.0)))) :rule cong :premises (t168.t19.t10 t168.t19.t11 t168.t19.t12 t168.t19.t13))
% 0.61/0.84  (step t168.t19.t15 (cl (= (+ 5.0 7.0 (- 6.0) (- 6.0)) 0.0)) :rule all_simplify)
% 0.61/0.84  (step t168.t19.t16 (cl (= (+ (* 1.0 5) (* 1.0 7) (* (- 3.0) 2) (* (- 2.0) 3)) 0.0)) :rule trans :premises (t168.t19.t14 t168.t19.t15))
% 0.61/0.84  (step t168.t19.t17 (cl (= (>= (+ (* 1.0 (* tptp.d tptp.c)) (* 1.0 (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 3.0) tptp.c) (* (- 2.0) tptp.d)) (+ (* 1.0 5) (* 1.0 7) (* (- 3.0) 2) (* (- 2.0) 3))) (>= 0.0 0.0))) :rule cong :premises (t168.t19.t9 t168.t19.t16))
% 0.61/0.84  (step t168.t19.t18 (cl (= (>= 0.0 0.0) true)) :rule all_simplify)
% 0.61/0.84  (step t168.t19.t19 (cl (= (>= (+ (* 1.0 (* tptp.d tptp.c)) (* 1.0 (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 3.0) tptp.c) (* (- 2.0) tptp.d)) (+ (* 1.0 5) (* 1.0 7) (* (- 3.0) 2) (* (- 2.0) 3))) true)) :rule trans :premises (t168.t19.t17 t168.t19.t18))
% 0.61/0.84  (step t168.t19.t20 (cl (= (not (>= (+ (* 1.0 (* tptp.d tptp.c)) (* 1.0 (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 3.0) tptp.c) (* (- 2.0) tptp.d)) (+ (* 1.0 5) (* 1.0 7) (* (- 3.0) 2) (* (- 2.0) 3)))) (not true))) :rule cong :premises (t168.t19.t19))
% 0.61/0.84  (step t168.t19.t21 (cl (= (not true) false)) :rule all_simplify)
% 0.61/0.84  (step t168.t19.t22 (cl (= (not (>= (+ (* 1.0 (* tptp.d tptp.c)) (* 1.0 (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 3.0) tptp.c) (* (- 2.0) tptp.d)) (+ (* 1.0 5) (* 1.0 7) (* (- 3.0) 2) (* (- 2.0) 3)))) false)) :rule trans :premises (t168.t19.t20 t168.t19.t21))
% 0.61/0.84  (step t168.t19.t23 (cl (= (< (+ (* 1.0 (* tptp.d tptp.c)) (* 1.0 (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 3.0) tptp.c) (* (- 2.0) tptp.d)) (+ (* 1.0 5) (* 1.0 7) (* (- 3.0) 2) (* (- 2.0) 3))) false)) :rule trans :premises (t168.t19.t2 t168.t19.t22))
% 0.61/0.84  (step t168.t19.t24 (cl (not (<= (* 1.0 (* tptp.d tptp.c)) (* 1.0 5))) (not (< (* 1.0 (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 1.0 7))) (not (<= (* (- 3.0) tptp.c) (* (- 3.0) 2))) (not (<= (* (- 2.0) tptp.d) (* (- 2.0) 3))) (< (+ (* 1.0 (* tptp.d tptp.c)) (* 1.0 (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 3.0) tptp.c) (* (- 2.0) tptp.d)) (+ (* 1.0 5) (* 1.0 7) (* (- 3.0) 2) (* (- 2.0) 3)))) :rule la_generic :args (1 1 1 1 1))
% 0.61/0.84  (step t168.t19.t25 (cl (=> (and (> 1.0 0) (<= (* tptp.d tptp.c) 5)) (<= (* 1.0 (* tptp.d tptp.c)) (* 1.0 5)))) :rule la_mult_pos)
% 0.61/0.84  (step t168.t19.t26 (cl (not (and (> 1.0 0) (<= (* tptp.d tptp.c) 5))) (<= (* 1.0 (* tptp.d tptp.c)) (* 1.0 5))) :rule implies :premises (t168.t19.t25))
% 0.61/0.84  (step t168.t19.t27 (cl (and (> 1.0 0) (<= (* tptp.d tptp.c) 5)) (not (> 1.0 0)) (not (<= (* tptp.d tptp.c) 5))) :rule and_neg)
% 0.61/0.84  (step t168.t19.t28 (cl (= (= (> 1.0 0) true) (> 1.0 0))) :rule equiv_simplify)
% 0.61/0.84  (step t168.t19.t29 (cl (not (= (> 1.0 0) true)) (> 1.0 0)) :rule equiv1 :premises (t168.t19.t28))
% 0.61/0.84  (step t168.t19.t30 (cl (= (> 1.0 0) true)) :rule hole :args ((> 1.0 0)))
% 0.61/0.84  (step t168.t19.t31 (cl (> 1.0 0)) :rule resolution :premises (t168.t19.t29 t168.t19.t30))
% 0.61/0.84  (step t168.t19.t32 (cl (and (> 1.0 0) (<= (* tptp.d tptp.c) 5))) :rule resolution :premises (t168.t19.t27 t168.t19.t31 t168.t19.a0))
% 0.61/0.84  (step t168.t19.t33 (cl (<= (* 1.0 (* tptp.d tptp.c)) (* 1.0 5))) :rule resolution :premises (t168.t19.t26 t168.t19.t32))
% 0.61/0.84  (step t168.t19.t34 (cl (=> (and (> 1.0 0) (< (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (< (* 1.0 (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 1.0 7)))) :rule la_mult_pos)
% 0.61/0.84  (step t168.t19.t35 (cl (not (and (> 1.0 0) (< (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (< (* 1.0 (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 1.0 7))) :rule implies :premises (t168.t19.t34))
% 0.61/0.84  (step t168.t19.t36 (cl (and (> 1.0 0) (< (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (> 1.0 0)) (not (< (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule and_neg)
% 0.61/0.84  (step t168.t19.t37 (cl (not (= (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (< (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (not (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (< (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) :rule equiv_pos2)
% 0.61/0.84  (step t168.t19.t38 (cl (= (< (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)))) :rule all_simplify)
% 0.61/0.84  (step t168.t19.t39 (cl (= (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (< (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule symm :premises (t168.t19.t38))
% 0.61/0.84  (step t168.t19.t40 (cl (< (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) :rule resolution :premises (t168.t19.t37 t168.t19.t39 t168.a2))
% 0.61/0.84  (step t168.t19.t41 (cl (and (> 1.0 0) (< (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule resolution :premises (t168.t19.t36 t168.t19.t31 t168.t19.t40))
% 0.61/0.84  (step t168.t19.t42 (cl (< (* 1.0 (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 1.0 7))) :rule resolution :premises (t168.t19.t35 t168.t19.t41))
% 0.61/0.84  (step t168.t19.t43 (cl (=> (and (< (- 3.0) 0) (>= tptp.c 2)) (<= (* (- 3.0) tptp.c) (* (- 3.0) 2)))) :rule la_mult_neg)
% 0.61/0.84  (step t168.t19.t44 (cl (not (and (< (- 3.0) 0) (>= tptp.c 2))) (<= (* (- 3.0) tptp.c) (* (- 3.0) 2))) :rule implies :premises (t168.t19.t43))
% 0.61/0.84  (step t168.t19.t45 (cl (and (< (- 3.0) 0) (>= tptp.c 2)) (not (< (- 3.0) 0)) (not (>= tptp.c 2))) :rule and_neg)
% 0.61/0.84  (step t168.t19.t46 (cl (= (= (< (- 3.0) 0) true) (< (- 3.0) 0))) :rule equiv_simplify)
% 0.61/0.84  (step t168.t19.t47 (cl (not (= (< (- 3.0) 0) true)) (< (- 3.0) 0)) :rule equiv1 :premises (t168.t19.t46))
% 0.61/0.84  (step t168.t19.t48 (cl (= (< (- 3.0) 0) true)) :rule hole :args ((< (- 3.0) 0)))
% 0.61/0.84  (step t168.t19.t49 (cl (< (- 3.0) 0)) :rule resolution :premises (t168.t19.t47 t168.t19.t48))
% 0.61/0.84  (step t168.t19.t50 (cl (and (< (- 3.0) 0) (>= tptp.c 2))) :rule resolution :premises (t168.t19.t45 t168.t19.t49 t168.a1))
% 0.61/0.84  (step t168.t19.t51 (cl (<= (* (- 3.0) tptp.c) (* (- 3.0) 2))) :rule resolution :premises (t168.t19.t44 t168.t19.t50))
% 0.61/0.84  (step t168.t19.t52 (cl (=> (and (< (- 2.0) 0) (>= tptp.d 3)) (<= (* (- 2.0) tptp.d) (* (- 2.0) 3)))) :rule la_mult_neg)
% 0.61/0.84  (step t168.t19.t53 (cl (not (and (< (- 2.0) 0) (>= tptp.d 3))) (<= (* (- 2.0) tptp.d) (* (- 2.0) 3))) :rule implies :premises (t168.t19.t52))
% 0.61/0.84  (step t168.t19.t54 (cl (and (< (- 2.0) 0) (>= tptp.d 3)) (not (< (- 2.0) 0)) (not (>= tptp.d 3))) :rule and_neg)
% 0.61/0.84  (step t168.t19.t55 (cl (= (= (< (- 2.0) 0) true) (< (- 2.0) 0))) :rule equiv_simplify)
% 0.61/0.84  (step t168.t19.t56 (cl (not (= (< (- 2.0) 0) true)) (< (- 2.0) 0)) :rule equiv1 :premises (t168.t19.t55))
% 0.61/0.84  (step t168.t19.t57 (cl (= (< (- 2.0) 0) true)) :rule hole :args ((< (- 2.0) 0)))
% 0.61/0.84  (step t168.t19.t58 (cl (< (- 2.0) 0)) :rule resolution :premises (t168.t19.t56 t168.t19.t57))
% 0.61/0.84  (step t168.t19.t59 (cl (and (< (- 2.0) 0) (>= tptp.d 3))) :rule resolution :premises (t168.t19.t54 t168.t19.t58 t168.a0))
% 0.61/0.84  (step t168.t19.t60 (cl (<= (* (- 2.0) tptp.d) (* (- 2.0) 3))) :rule resolution :premises (t168.t19.t53 t168.t19.t59))
% 0.61/0.84  (step t168.t19.t61 (cl (< (+ (* 1.0 (* tptp.d tptp.c)) (* 1.0 (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 3.0) tptp.c) (* (- 2.0) tptp.d)) (+ (* 1.0 5) (* 1.0 7) (* (- 3.0) 2) (* (- 2.0) 3)))) :rule resolution :premises (t168.t19.t24 t168.t19.t33 t168.t19.t42 t168.t19.t51 t168.t19.t60))
% 0.61/0.84  (step t168.t19.t62 (cl false) :rule resolution :premises (t168.t19.t1 t168.t19.t23 t168.t19.t61))
% 0.61/0.84  (step t168.t19 (cl (not (<= (* tptp.d tptp.c) 5)) false) :rule subproof :discharge (t168.t19.a0))
% 0.61/0.84  (step t168.t20 (cl (=> (<= (* tptp.d tptp.c) 5) false) false) :rule resolution :premises (t168.t18 t168.t19))
% 0.61/0.84  (step t168.t21 (cl (=> (<= (* tptp.d tptp.c) 5) false) (not false)) :rule implies_neg2)
% 0.61/0.84  (step t168.t22 (cl (=> (<= (* tptp.d tptp.c) 5) false) (=> (<= (* tptp.d tptp.c) 5) false)) :rule resolution :premises (t168.t20 t168.t21))
% 0.61/0.84  (step t168.t23 (cl (=> (<= (* tptp.d tptp.c) 5) false)) :rule contraction :premises (t168.t22))
% 0.61/0.84  (step t168.t24 (cl (= (=> (<= (* tptp.d tptp.c) 5) false) (not (<= (* tptp.d tptp.c) 5)))) :rule implies_simplify)
% 0.61/0.84  (step t168.t25 (cl (not (=> (<= (* tptp.d tptp.c) 5) false)) (not (<= (* tptp.d tptp.c) 5))) :rule equiv1 :premises (t168.t24))
% 0.61/0.84  (step t168.t26 (cl (not (<= (* tptp.d tptp.c) 5))) :rule resolution :premises (t168.t23 t168.t25))
% 0.61/0.84  (step t168.t27 (cl (> (* tptp.d tptp.c) 5)) :rule resolution :premises (t168.t15 t168.t17 t168.t26))
% 0.61/0.84  (step t168.t28 (cl (not (<= (* tptp.d tptp.c) 5))) :rule resolution :premises (t168.t7 t168.t14 t168.t27))
% 0.61/0.84  (step t168.t29 (cl) :rule resolution :premises (t168.t6 t168.t28))
% 0.61/0.84  (step t168 (cl (not (>= tptp.d 3)) (not (>= tptp.c 2)) (not (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (not (not (>= (* tptp.d tptp.c) 6))) false) :rule subproof :discharge (t168.a0 t168.a1 t168.a2 t168.a3))
% 0.61/0.84  (step t169 (cl (not (and (>= tptp.d 3) (>= tptp.c 2) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (>= (* tptp.d tptp.c) 6)))) (>= tptp.d 3)) :rule and_pos)
% 0.61/0.84  (step t170 (cl (not (and (>= tptp.d 3) (>= tptp.c 2) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (>= (* tptp.d tptp.c) 6)))) (>= tptp.c 2)) :rule and_pos)
% 0.61/0.84  (step t171 (cl (not (and (>= tptp.d 3) (>= tptp.c 2) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (>= (* tptp.d tptp.c) 6)))) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule and_pos)
% 0.61/0.84  (step t172 (cl (not (and (>= tptp.d 3) (>= tptp.c 2) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (>= (* tptp.d tptp.c) 6)))) (not (>= (* tptp.d tptp.c) 6))) :rule and_pos)
% 0.61/0.84  (step t173 (cl false (not (and (>= tptp.d 3) (>= tptp.c 2) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (>= (* tptp.d tptp.c) 6)))) (not (and (>= tptp.d 3) (>= tptp.c 2) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (>= (* tptp.d tptp.c) 6)))) (not (and (>= tptp.d 3) (>= tptp.c 2) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (>= (* tptp.d tptp.c) 6)))) (not (and (>= tptp.d 3) (>= tptp.c 2) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (>= (* tptp.d tptp.c) 6))))) :rule resolution :premises (t168 t169 t170 t171 t172))
% 0.61/0.84  (step t174 (cl (not (and (>= tptp.d 3) (>= tptp.c 2) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (>= (* tptp.d tptp.c) 6)))) (not (and (>= tptp.d 3) (>= tptp.c 2) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (>= (* tptp.d tptp.c) 6)))) (not (and (>= tptp.d 3) (>= tptp.c 2) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (>= (* tptp.d tptp.c) 6)))) (not (and (>= tptp.d 3) (>= tptp.c 2) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (>= (* tptp.d tptp.c) 6)))) false) :rule reordering :premises (t173))
% 0.61/0.84  (step t175 (cl (not (and (>= tptp.d 3) (>= tptp.c 2) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (>= (* tptp.d tptp.c) 6)))) false) :rule contraction :premises (t174))
% 0.61/0.84  (step t176 (cl (=> (and (>= tptp.d 3) (>= tptp.c 2) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (>= (* tptp.d tptp.c) 6))) false) false) :rule resolution :premises (t167 t175))
% 0.61/0.84  (step t177 (cl (=> (and (>= tptp.d 3) (>= tptp.c 2) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (>= (* tptp.d tptp.c) 6))) false) (not false)) :rule implies_neg2)
% 0.61/0.84  (step t178 (cl (=> (and (>= tptp.d 3) (>= tptp.c 2) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (>= (* tptp.d tptp.c) 6))) false) (=> (and (>= tptp.d 3) (>= tptp.c 2) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (>= (* tptp.d tptp.c) 6))) false)) :rule resolution :premises (t176 t177))
% 0.61/0.85  (step t179 (cl (=> (and (>= tptp.d 3) (>= tptp.c 2) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (>= (* tptp.d tptp.c) 6))) false)) :rule contraction :premises (t178))
% 0.61/0.85  (step t180 (cl (= (=> (and (>= tptp.d 3) (>= tptp.c 2) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (>= (* tptp.d tptp.c) 6))) false) (not (and (>= tptp.d 3) (>= tptp.c 2) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (>= (* tptp.d tptp.c) 6)))))) :rule implies_simplify)
% 0.61/0.85  (step t181 (cl (not (=> (and (>= tptp.d 3) (>= tptp.c 2) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (>= (* tptp.d tptp.c) 6))) false)) (not (and (>= tptp.d 3) (>= tptp.c 2) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (>= (* tptp.d tptp.c) 6))))) :rule equiv1 :premises (t180))
% 0.61/0.85  (step t182 (cl (not (and (>= tptp.d 3) (>= tptp.c 2) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (>= (* tptp.d tptp.c) 6))))) :rule resolution :premises (t179 t181))
% 0.61/0.85  (step t183 (cl (not (>= tptp.d 3)) (not (>= tptp.c 2)) (not (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (not (not (>= (* tptp.d tptp.c) 6)))) :rule not_and :premises (t182))
% 0.61/0.85  (step t184 (cl (or (not (>= tptp.d 3)) (not (>= tptp.c 2)) (not (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (not (not (>= (* tptp.d tptp.c) 6)))) (not (not (>= tptp.d 3)))) :rule or_neg)
% 0.61/0.85  (step t185 (cl (or (not (>= tptp.d 3)) (not (>= tptp.c 2)) (not (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (not (not (>= (* tptp.d tptp.c) 6)))) (not (not (>= tptp.c 2)))) :rule or_neg)
% 0.61/0.85  (step t186 (cl (or (not (>= tptp.d 3)) (not (>= tptp.c 2)) (not (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (not (not (>= (* tptp.d tptp.c) 6)))) (not (not (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))))) :rule or_neg)
% 0.61/0.85  (step t187 (cl (or (not (>= tptp.d 3)) (not (>= tptp.c 2)) (not (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (not (not (>= (* tptp.d tptp.c) 6)))) (not (not (not (>= (* tptp.d tptp.c) 6))))) :rule or_neg)
% 0.61/0.85  (step t188 (cl (or (not (>= tptp.d 3)) (not (>= tptp.c 2)) (not (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (not (not (>= (* tptp.d tptp.c) 6)))) (or (not (>= tptp.d 3)) (not (>= tptp.c 2)) (not (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (not (not (>= (* tptp.d tptp.c) 6)))) (or (not (>= tptp.d 3)) (not (>= tptp.c 2)) (not (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (not (not (>= (* tptp.d tptp.c) 6)))) (or (not (>= tptp.d 3)) (not (>= tptp.c 2)) (not (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (not (not (>= (* tptp.d tptp.c) 6))))) :rule resolution :premises (t183 t184 t185 t186 t187))
% 0.61/0.85  (step t189 (cl (or (not (>= tptp.d 3)) (not (>= tptp.c 2)) (not (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (not (not (>= (* tptp.d tptp.c) 6))))) :rule contraction :premises (t188))
% 0.61/0.85  (step t190 (cl (or (not (>= tptp.d 3)) (not (>= tptp.c 2)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (>= (* tptp.d tptp.c) 6))) :rule resolution :premises (t153 t166 t189))
% 0.61/0.85  (step t191 (cl (not (>= tptp.d 3)) (not (>= tptp.c 2)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (>= (* tptp.d tptp.c) 6)) :rule or :premises (t190))
% 0.61/0.85  (step t192 (cl (>= (* tptp.d tptp.c) 6) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= tptp.d 3)) (not (>= tptp.c 2))) :rule reordering :premises (t191))
% 0.61/0.85  (step t193 (cl (not (= (<= 2 tptp.c) (>= tptp.c 2))) (not (<= 2 tptp.c)) (>= tptp.c 2)) :rule equiv_pos2)
% 0.61/0.85  (step t194 (cl (= (<= 2 tptp.c) (>= tptp.c 2))) :rule all_simplify)
% 0.61/0.85  (step t195 (cl (>= tptp.c 2)) :rule resolution :premises (t193 t194 a1))
% 0.61/0.85  (step t196 (cl (not (= (<= 3 tptp.d) (>= tptp.d 3))) (not (<= 3 tptp.d)) (>= tptp.d 3)) :rule equiv_pos2)
% 0.61/0.85  (step t197 (cl (= (<= 3 tptp.d) (>= tptp.d 3))) :rule all_simplify)
% 0.61/0.85  (step t198 (cl (>= tptp.d 3)) :rule resolution :premises (t196 t197 a0))
% 0.61/0.85  (step t199 (cl (>= (* tptp.d tptp.c) 6) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule not_equiv1 :premises (t144))
% 0.61/0.85  (step t200 (cl (>= (* tptp.d tptp.c) 6) (>= (* tptp.d tptp.c) 6)) :rule resolution :premises (t192 t195 t198 t199))
% 0.61/0.85  (step t201 (cl (>= (* tptp.d tptp.c) 6)) :rule contraction :premises (t200))
% 0.61/0.85  (step t202 (cl (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) :rule resolution :premises (t152 t201))
% 0.61/0.85  (step t203 (cl (not (= (=> (and (> tptp.d 0) (>= tptp.c 2)) (>= (* tptp.d tptp.c) (* tptp.d (* (- 1) (- 2))))) (=> (and (>= tptp.d 1) (>= tptp.c 2)) (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))))) (not (=> (and (> tptp.d 0) (>= tptp.c 2)) (>= (* tptp.d tptp.c) (* tptp.d (* (- 1) (- 2)))))) (=> (and (>= tptp.d 1) (>= tptp.c 2)) (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)))) :rule equiv_pos2)
% 0.61/0.85  (step t204 (cl (= (> tptp.d 0) (not (<= tptp.d 0)))) :rule all_simplify)
% 0.61/0.85  (step t205 (cl (= (<= tptp.d 0) (not (>= tptp.d 1)))) :rule all_simplify)
% 0.61/0.85  (step t206 (cl (= (not (<= tptp.d 0)) (not (not (>= tptp.d 1))))) :rule cong :premises (t205))
% 0.61/0.85  (step t207 (cl (= (not (not (>= tptp.d 1))) (>= tptp.d 1))) :rule all_simplify)
% 0.61/0.85  (step t208 (cl (= (not (<= tptp.d 0)) (>= tptp.d 1))) :rule trans :premises (t206 t207))
% 0.61/0.85  (step t209 (cl (= (> tptp.d 0) (>= tptp.d 1))) :rule trans :premises (t204 t208))
% 0.61/0.85  (step t210 (cl (= (>= tptp.c 2) (>= tptp.c 2))) :rule refl)
% 0.61/0.85  (step t211 (cl (= (and (> tptp.d 0) (>= tptp.c 2)) (and (>= tptp.d 1) (>= tptp.c 2)))) :rule cong :premises (t209 t210))
% 0.61/0.85  (step t212 (cl (= (* tptp.d tptp.c) (* tptp.d tptp.c))) :rule all_simplify)
% 0.61/0.85  (step t213 (cl (= (* (- 1) (- 2)) 2)) :rule all_simplify)
% 0.61/0.85  (step t214 (cl (= (* tptp.d (* (- 1) (- 2))) (* tptp.d 2))) :rule cong :premises (t126 t213))
% 0.61/0.85  (step t215 (cl (= (* tptp.d 2) (* 2 tptp.d))) :rule all_simplify)
% 0.61/0.85  (step t216 (cl (= (* tptp.d (* (- 1) (- 2))) (* 2 tptp.d))) :rule trans :premises (t214 t215))
% 0.61/0.85  (step t217 (cl (= (>= (* tptp.d tptp.c) (* tptp.d (* (- 1) (- 2)))) (>= (* tptp.d tptp.c) (* 2 tptp.d)))) :rule cong :premises (t212 t216))
% 0.61/0.85  (step t218 (cl (= (>= (* tptp.d tptp.c) (* 2 tptp.d)) (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)))) :rule all_simplify)
% 0.61/0.85  (step t219 (cl (= (>= (* tptp.d tptp.c) (* tptp.d (* (- 1) (- 2)))) (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)))) :rule trans :premises (t217 t218))
% 0.61/0.85  (step t220 (cl (= (=> (and (> tptp.d 0) (>= tptp.c 2)) (>= (* tptp.d tptp.c) (* tptp.d (* (- 1) (- 2))))) (=> (and (>= tptp.d 1) (>= tptp.c 2)) (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))))) :rule cong :premises (t211 t219))
% 0.61/0.85  (step t221 (cl (not (= (=> (and (> tptp.d 0) (>= tptp.c (* (- 1) (- 2)))) (>= (* tptp.d tptp.c) (* tptp.d (* (- 1) (- 2))))) (=> (and (> tptp.d 0) (>= tptp.c 2)) (>= (* tptp.d tptp.c) (* tptp.d (* (- 1) (- 2))))))) (not (=> (and (> tptp.d 0) (>= tptp.c (* (- 1) (- 2)))) (>= (* tptp.d tptp.c) (* tptp.d (* (- 1) (- 2)))))) (=> (and (> tptp.d 0) (>= tptp.c 2)) (>= (* tptp.d tptp.c) (* tptp.d (* (- 1) (- 2)))))) :rule equiv_pos2)
% 0.61/0.85  (step t222 (cl (= (>= tptp.c (* (- 1) (- 2))) (>= tptp.c 2))) :rule cong :premises (t135 t213))
% 0.61/0.85  (step t223 (cl (= (and (> tptp.d 0) (>= tptp.c (* (- 1) (- 2)))) (and (>= tptp.d 1) (>= tptp.c 2)))) :rule cong :premises (t209 t222))
% 0.61/0.85  (step t224 (cl (= (=> (and (> tptp.d 0) (>= tptp.c (* (- 1) (- 2)))) (>= (* tptp.d tptp.c) (* tptp.d (* (- 1) (- 2))))) (=> (and (>= tptp.d 1) (>= tptp.c 2)) (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))))) :rule cong :premises (t223 t219))
% 0.61/0.85  (step t225 (cl (= (=> (and (> tptp.d 0) (>= tptp.c 2)) (>= (* tptp.d tptp.c) (* tptp.d (* (- 1) (- 2))))) (=> (and (>= tptp.d 1) (>= tptp.c 2)) (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))))) :rule cong :premises (t211 t219))
% 0.61/0.85  (step t226 (cl (= (=> (and (>= tptp.d 1) (>= tptp.c 2)) (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) (=> (and (> tptp.d 0) (>= tptp.c 2)) (>= (* tptp.d tptp.c) (* tptp.d (* (- 1) (- 2))))))) :rule symm :premises (t225))
% 0.61/0.85  (step t227 (cl (= (=> (and (> tptp.d 0) (>= tptp.c (* (- 1) (- 2)))) (>= (* tptp.d tptp.c) (* tptp.d (* (- 1) (- 2))))) (=> (and (> tptp.d 0) (>= tptp.c 2)) (>= (* tptp.d tptp.c) (* tptp.d (* (- 1) (- 2))))))) :rule trans :premises (t224 t226))
% 0.61/0.85  (step t228 (cl (=> (and (> tptp.d 0) (>= tptp.c (* (- 1) (- 2)))) (>= (* tptp.d tptp.c) (* tptp.d (* (- 1) (- 2)))))) :rule la_mult_pos)
% 0.61/0.85  (step t229 (cl (=> (and (> tptp.d 0) (>= tptp.c 2)) (>= (* tptp.d tptp.c) (* tptp.d (* (- 1) (- 2)))))) :rule resolution :premises (t221 t227 t228))
% 0.61/0.85  (step t230 (cl (=> (and (>= tptp.d 1) (>= tptp.c 2)) (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)))) :rule resolution :premises (t203 t220 t229))
% 0.61/0.85  (step t231 (cl (not (and (>= tptp.d 1) (>= tptp.c 2))) (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) :rule implies :premises (t230))
% 0.61/0.85  (step t232 (cl (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (and (>= tptp.d 1) (>= tptp.c 2)))) :rule reordering :premises (t231))
% 0.61/0.85  (step t233 (cl (and (>= tptp.d 1) (>= tptp.c 2)) (not (>= tptp.d 1)) (not (>= tptp.c 2))) :rule and_neg)
% 0.61/0.85  (step t234 (cl (not (>= tptp.c 2)) (not (>= tptp.d 1)) (and (>= tptp.d 1) (>= tptp.c 2))) :rule reordering :premises (t233))
% 0.61/0.85  (step t235 (cl (not (= (or (not (>= tptp.d 5)) (not (not (>= tptp.d 1)))) (or (not (>= tptp.d 5)) (>= tptp.d 1)))) (not (or (not (>= tptp.d 5)) (not (not (>= tptp.d 1))))) (or (not (>= tptp.d 5)) (>= tptp.d 1))) :rule equiv_pos2)
% 0.61/0.85  (step t236 (cl (= (not (>= tptp.d 5)) (not (>= tptp.d 5)))) :rule refl)
% 0.61/0.85  (step t237 (cl (= (= (= (not (not (>= tptp.d 1))) (>= tptp.d 1)) true) (= (not (not (>= tptp.d 1))) (>= tptp.d 1)))) :rule equiv_simplify)
% 0.61/0.85  (step t238 (cl (not (= (= (not (not (>= tptp.d 1))) (>= tptp.d 1)) true)) (= (not (not (>= tptp.d 1))) (>= tptp.d 1))) :rule equiv1 :premises (t237))
% 0.61/0.85  (step t239 (cl (= (= (not (not (>= tptp.d 1))) (>= tptp.d 1)) (= (>= tptp.d 1) (not (not (>= tptp.d 1)))))) :rule all_simplify)
% 0.61/0.85  (step t240 (cl (= (>= tptp.d 1) (>= tptp.d 1))) :rule refl)
% 0.61/0.85  (step t241 (cl (= (= (>= tptp.d 1) (not (not (>= tptp.d 1)))) (= (>= tptp.d 1) (>= tptp.d 1)))) :rule cong :premises (t240 t207))
% 0.61/0.85  (step t242 (cl (= (= (>= tptp.d 1) (>= tptp.d 1)) true)) :rule all_simplify)
% 0.61/0.85  (step t243 (cl (= (= (>= tptp.d 1) (not (not (>= tptp.d 1)))) true)) :rule trans :premises (t241 t242))
% 0.61/0.85  (step t244 (cl (= (= (not (not (>= tptp.d 1))) (>= tptp.d 1)) true)) :rule trans :premises (t239 t243))
% 0.61/0.85  (step t245 (cl (= (not (not (>= tptp.d 1))) (>= tptp.d 1))) :rule resolution :premises (t238 t244))
% 0.61/0.85  (step t246 (cl (= (or (not (>= tptp.d 5)) (not (not (>= tptp.d 1)))) (or (not (>= tptp.d 5)) (>= tptp.d 1)))) :rule cong :premises (t236 t245))
% 0.61/0.85  (step t247 (cl (not (= (=> (and (>= tptp.d 5) (not (>= tptp.d 1))) (and (not (>= tptp.d 1)) (>= tptp.d 5))) (not (and (>= tptp.d 5) (not (>= tptp.d 1)))))) (not (=> (and (>= tptp.d 5) (not (>= tptp.d 1))) (and (not (>= tptp.d 1)) (>= tptp.d 5)))) (not (and (>= tptp.d 5) (not (>= tptp.d 1))))) :rule equiv_pos2)
% 0.61/0.85  (step t248 (cl (= (and (>= tptp.d 5) (not (>= tptp.d 1))) (and (>= tptp.d 5) (not (>= tptp.d 1))))) :rule refl)
% 0.61/0.85  (step t249 (cl (= (= (and (not (>= tptp.d 1)) (>= tptp.d 5)) false) (not (and (not (>= tptp.d 1)) (>= tptp.d 5))))) :rule equiv_simplify)
% 0.61/0.85  (step t250 (cl (= (and (not (>= tptp.d 1)) (>= tptp.d 5)) false) (not (not (and (not (>= tptp.d 1)) (>= tptp.d 5))))) :rule equiv2 :premises (t249))
% 0.61/0.85  (step t251 (cl (not (not (not (and (not (>= tptp.d 1)) (>= tptp.d 5))))) (and (not (>= tptp.d 1)) (>= tptp.d 5))) :rule not_not)
% 0.61/0.85  (step t252 (cl (= (and (not (>= tptp.d 1)) (>= tptp.d 5)) false) (and (not (>= tptp.d 1)) (>= tptp.d 5))) :rule resolution :premises (t250 t251))
% 0.61/0.85  (step t253 (cl (=> (and (not (>= tptp.d 1)) (>= tptp.d 5)) false) (and (not (>= tptp.d 1)) (>= tptp.d 5))) :rule implies_neg1)
% 0.61/0.85  (anchor :step t254)
% 0.61/0.85  (assume t254.a0 (not (>= tptp.d 1)))
% 0.61/0.85  (assume t254.a1 (>= tptp.d 5))
% 0.61/0.85  (step t254.t1 (cl (not (= (not (<= tptp.d 0)) (> tptp.d 0))) (not (not (<= tptp.d 0))) (> tptp.d 0)) :rule equiv_pos2)
% 0.61/0.85  (step t254.t2 (cl (= (>= tptp.d 1) (> tptp.d 0))) :rule symm :premises (t209))
% 0.61/0.85  (step t254.t3 (cl (= (not (<= tptp.d 0)) (> tptp.d 0))) :rule trans :premises (t208 t254.t2))
% 0.61/0.85  (step t254.t4 (cl (=> (<= tptp.d 0) false) (<= tptp.d 0)) :rule implies_neg1)
% 0.61/0.85  (anchor :step t254.t5)
% 0.61/0.85  (assume t254.t5.a0 (<= tptp.d 0))
% 0.61/0.85  (step t254.t5.t1 (cl (not (= (<= (+ (* 1.0 tptp.d) (* (- 1.0) tptp.d)) (+ (* 1.0 0) (* (- 1.0) 5))) false)) (not (<= (+ (* 1.0 tptp.d) (* (- 1.0) tptp.d)) (+ (* 1.0 0) (* (- 1.0) 5)))) false) :rule equiv_pos2)
% 0.61/0.85  (step t254.t5.t2 (cl (= (* 1.0 tptp.d) (to_real tptp.d))) :rule all_simplify)
% 0.61/0.85  (step t254.t5.t3 (cl (= (* (- 1.0) tptp.d) (to_real (* (- 1) tptp.d)))) :rule all_simplify)
% 0.61/0.85  (step t254.t5.t4 (cl (= (+ (* 1.0 tptp.d) (* (- 1.0) tptp.d)) (+ (to_real tptp.d) (to_real (* (- 1) tptp.d))))) :rule cong :premises (t254.t5.t2 t254.t5.t3))
% 0.61/0.85  (step t254.t5.t5 (cl (= (+ (to_real tptp.d) (to_real (* (- 1) tptp.d))) 0.0)) :rule all_simplify)
% 0.61/0.85  (step t254.t5.t6 (cl (= (+ (* 1.0 tptp.d) (* (- 1.0) tptp.d)) 0.0)) :rule trans :premises (t254.t5.t4 t254.t5.t5))
% 0.61/0.85  (step t254.t5.t7 (cl (= (* 1.0 0) 0.0)) :rule all_simplify)
% 0.61/0.85  (step t254.t5.t8 (cl (= (* (- 1.0) 5) (- 5.0))) :rule all_simplify)
% 0.61/0.85  (step t254.t5.t9 (cl (= (+ (* 1.0 0) (* (- 1.0) 5)) (+ 0.0 (- 5.0)))) :rule cong :premises (t254.t5.t7 t254.t5.t8))
% 0.61/0.85  (step t254.t5.t10 (cl (= (+ 0.0 (- 5.0)) (- 5.0))) :rule all_simplify)
% 0.61/0.85  (step t254.t5.t11 (cl (= (+ (* 1.0 0) (* (- 1.0) 5)) (- 5.0))) :rule trans :premises (t254.t5.t9 t254.t5.t10))
% 0.61/0.85  (step t254.t5.t12 (cl (= (<= (+ (* 1.0 tptp.d) (* (- 1.0) tptp.d)) (+ (* 1.0 0) (* (- 1.0) 5))) (<= 0.0 (- 5.0)))) :rule cong :premises (t254.t5.t6 t254.t5.t11))
% 0.61/0.85  (step t254.t5.t13 (cl (= (<= 0.0 (- 5.0)) false)) :rule all_simplify)
% 0.61/0.85  (step t254.t5.t14 (cl (= (<= (+ (* 1.0 tptp.d) (* (- 1.0) tptp.d)) (+ (* 1.0 0) (* (- 1.0) 5))) false)) :rule trans :premises (t254.t5.t12 t254.t5.t13))
% 0.61/0.85  (step t254.t5.t15 (cl (not (<= (* 1.0 tptp.d) (* 1.0 0))) (not (<= (* (- 1.0) tptp.d) (* (- 1.0) 5))) (<= (+ (* 1.0 tptp.d) (* (- 1.0) tptp.d)) (+ (* 1.0 0) (* (- 1.0) 5)))) :rule la_generic :args (1 1 1))
% 0.61/0.85  (step t254.t5.t16 (cl (=> (and (> 1.0 0) (<= tptp.d 0)) (<= (* 1.0 tptp.d) (* 1.0 0)))) :rule la_mult_pos)
% 0.61/0.85  (step t254.t5.t17 (cl (not (and (> 1.0 0) (<= tptp.d 0))) (<= (* 1.0 tptp.d) (* 1.0 0))) :rule implies :premises (t254.t5.t16))
% 0.61/0.85  (step t254.t5.t18 (cl (and (> 1.0 0) (<= tptp.d 0)) (not (> 1.0 0)) (not (<= tptp.d 0))) :rule and_neg)
% 0.61/0.85  (step t254.t5.t19 (cl (= (= (> 1.0 0) true) (> 1.0 0))) :rule equiv_simplify)
% 0.61/0.85  (step t254.t5.t20 (cl (not (= (> 1.0 0) true)) (> 1.0 0)) :rule equiv1 :premises (t254.t5.t19))
% 0.61/0.85  (step t254.t5.t21 (cl (= (> 1.0 0) true)) :rule hole :args ((> 1.0 0)))
% 0.61/0.85  (step t254.t5.t22 (cl (> 1.0 0)) :rule resolution :premises (t254.t5.t20 t254.t5.t21))
% 0.61/0.85  (step t254.t5.t23 (cl (and (> 1.0 0) (<= tptp.d 0))) :rule resolution :premises (t254.t5.t18 t254.t5.t22 t254.t5.a0))
% 0.61/0.85  (step t254.t5.t24 (cl (<= (* 1.0 tptp.d) (* 1.0 0))) :rule resolution :premises (t254.t5.t17 t254.t5.t23))
% 0.61/0.85  (step t254.t5.t25 (cl (=> (and (< (- 1.0) 0) (>= tptp.d 5)) (<= (* (- 1.0) tptp.d) (* (- 1.0) 5)))) :rule la_mult_neg)
% 0.61/0.85  (step t254.t5.t26 (cl (not (and (< (- 1.0) 0) (>= tptp.d 5))) (<= (* (- 1.0) tptp.d) (* (- 1.0) 5))) :rule implies :premises (t254.t5.t25))
% 0.61/0.85  (step t254.t5.t27 (cl (and (< (- 1.0) 0) (>= tptp.d 5)) (not (< (- 1.0) 0)) (not (>= tptp.d 5))) :rule and_neg)
% 0.61/0.85  (step t254.t5.t28 (cl (= (= (< (- 1.0) 0) true) (< (- 1.0) 0))) :rule equiv_simplify)
% 0.61/0.85  (step t254.t5.t29 (cl (not (= (< (- 1.0) 0) true)) (< (- 1.0) 0)) :rule equiv1 :premises (t254.t5.t28))
% 0.61/0.85  (step t254.t5.t30 (cl (= (< (- 1.0) 0) true)) :rule hole :args ((< (- 1.0) 0)))
% 0.61/0.85  (step t254.t5.t31 (cl (< (- 1.0) 0)) :rule resolution :premises (t254.t5.t29 t254.t5.t30))
% 0.61/0.85  (step t254.t5.t32 (cl (and (< (- 1.0) 0) (>= tptp.d 5))) :rule resolution :premises (t254.t5.t27 t254.t5.t31 t254.a1))
% 0.61/0.85  (step t254.t5.t33 (cl (<= (* (- 1.0) tptp.d) (* (- 1.0) 5))) :rule resolution :premises (t254.t5.t26 t254.t5.t32))
% 0.61/0.85  (step t254.t5.t34 (cl (<= (+ (* 1.0 tptp.d) (* (- 1.0) tptp.d)) (+ (* 1.0 0) (* (- 1.0) 5)))) :rule resolution :premises (t254.t5.t15 t254.t5.t24 t254.t5.t33))
% 0.61/0.85  (step t254.t5.t35 (cl false) :rule resolution :premises (t254.t5.t1 t254.t5.t14 t254.t5.t34))
% 0.61/0.85  (step t254.t5 (cl (not (<= tptp.d 0)) false) :rule subproof :discharge (t254.t5.a0))
% 0.61/0.85  (step t254.t6 (cl (=> (<= tptp.d 0) false) false) :rule resolution :premises (t254.t4 t254.t5))
% 0.61/0.85  (step t254.t7 (cl (=> (<= tptp.d 0) false) (not false)) :rule implies_neg2)
% 0.61/0.85  (step t254.t8 (cl (=> (<= tptp.d 0) false) (=> (<= tptp.d 0) false)) :rule resolution :premises (t254.t6 t254.t7))
% 0.61/0.85  (step t254.t9 (cl (=> (<= tptp.d 0) false)) :rule contraction :premises (t254.t8))
% 0.61/0.85  (step t254.t10 (cl (= (=> (<= tptp.d 0) false) (not (<= tptp.d 0)))) :rule implies_simplify)
% 0.61/0.85  (step t254.t11 (cl (not (=> (<= tptp.d 0) false)) (not (<= tptp.d 0))) :rule equiv1 :premises (t254.t10))
% 0.61/0.85  (step t254.t12 (cl (not (<= tptp.d 0))) :rule resolution :premises (t254.t9 t254.t11))
% 0.61/0.85  (step t254.t13 (cl (> tptp.d 0)) :rule resolution :premises (t254.t1 t254.t3 t254.t12))
% 0.61/0.85  (step t254.t14 (cl (not (= (<= tptp.d 0) (not (> tptp.d 0)))) (not (<= tptp.d 0)) (not (> tptp.d 0))) :rule equiv_pos2)
% 0.61/0.85  (step t254.t15 (cl (= (not (> tptp.d 0)) (not (>= tptp.d 1)))) :rule cong :premises (t209))
% 0.61/0.85  (step t254.t16 (cl (= (not (>= tptp.d 1)) (not (> tptp.d 0)))) :rule symm :premises (t254.t15))
% 0.61/0.85  (step t254.t17 (cl (= (<= tptp.d 0) (not (> tptp.d 0)))) :rule trans :premises (t205 t254.t16))
% 0.61/0.85  (step t254.t18 (cl (not (< tptp.d 1)) (<= tptp.d 0)) :rule la_generic :args (1 1))
% 0.61/0.85  (step t254.t19 (cl (not (= (not (>= tptp.d 1)) (< tptp.d 1))) (not (not (>= tptp.d 1))) (< tptp.d 1)) :rule equiv_pos2)
% 0.61/0.85  (step t254.t20 (cl (= (< tptp.d 1) (not (>= tptp.d 1)))) :rule all_simplify)
% 0.61/0.85  (step t254.t21 (cl (= (not (>= tptp.d 1)) (< tptp.d 1))) :rule symm :premises (t254.t20))
% 0.61/0.85  (step t254.t22 (cl (< tptp.d 1)) :rule resolution :premises (t254.t19 t254.t21 t254.a0))
% 0.61/0.85  (step t254.t23 (cl (<= tptp.d 0)) :rule resolution :premises (t254.t18 t254.t22))
% 0.61/0.85  (step t254.t24 (cl (not (> tptp.d 0))) :rule resolution :premises (t254.t14 t254.t17 t254.t23))
% 0.61/0.85  (step t254.t25 (cl) :rule resolution :premises (t254.t13 t254.t24))
% 0.61/0.85  (step t254 (cl (not (not (>= tptp.d 1))) (not (>= tptp.d 5)) false) :rule subproof :discharge (t254.a0 t254.a1))
% 0.61/0.85  (step t255 (cl (not (and (not (>= tptp.d 1)) (>= tptp.d 5))) (not (>= tptp.d 1))) :rule and_pos)
% 0.61/0.85  (step t256 (cl (not (and (not (>= tptp.d 1)) (>= tptp.d 5))) (>= tptp.d 5)) :rule and_pos)
% 0.61/0.85  (step t257 (cl false (not (and (not (>= tptp.d 1)) (>= tptp.d 5))) (not (and (not (>= tptp.d 1)) (>= tptp.d 5)))) :rule resolution :premises (t254 t255 t256))
% 0.61/0.85  (step t258 (cl (not (and (not (>= tptp.d 1)) (>= tptp.d 5))) (not (and (not (>= tptp.d 1)) (>= tptp.d 5))) false) :rule reordering :premises (t257))
% 0.61/0.85  (step t259 (cl (not (and (not (>= tptp.d 1)) (>= tptp.d 5))) false) :rule contraction :premises (t258))
% 0.61/0.85  (step t260 (cl (=> (and (not (>= tptp.d 1)) (>= tptp.d 5)) false) false) :rule resolution :premises (t253 t259))
% 0.61/0.85  (step t261 (cl (=> (and (not (>= tptp.d 1)) (>= tptp.d 5)) false) (not false)) :rule implies_neg2)
% 0.61/0.85  (step t262 (cl (=> (and (not (>= tptp.d 1)) (>= tptp.d 5)) false) (=> (and (not (>= tptp.d 1)) (>= tptp.d 5)) false)) :rule resolution :premises (t260 t261))
% 0.61/0.85  (step t263 (cl (=> (and (not (>= tptp.d 1)) (>= tptp.d 5)) false)) :rule contraction :premises (t262))
% 0.61/0.85  (step t264 (cl (= (=> (and (not (>= tptp.d 1)) (>= tptp.d 5)) false) (not (and (not (>= tptp.d 1)) (>= tptp.d 5))))) :rule implies_simplify)
% 0.61/0.85  (step t265 (cl (not (=> (and (not (>= tptp.d 1)) (>= tptp.d 5)) false)) (not (and (not (>= tptp.d 1)) (>= tptp.d 5)))) :rule equiv1 :premises (t264))
% 0.61/0.85  (step t266 (cl (not (and (not (>= tptp.d 1)) (>= tptp.d 5)))) :rule resolution :premises (t263 t265))
% 0.61/0.85  (step t267 (cl (= (and (not (>= tptp.d 1)) (>= tptp.d 5)) false)) :rule resolution :premises (t252 t266))
% 0.61/0.85  (step t268 (cl (= (=> (and (>= tptp.d 5) (not (>= tptp.d 1))) (and (not (>= tptp.d 1)) (>= tptp.d 5))) (=> (and (>= tptp.d 5) (not (>= tptp.d 1))) false))) :rule cong :premises (t248 t267))
% 0.61/0.85  (step t269 (cl (= (=> (and (>= tptp.d 5) (not (>= tptp.d 1))) false) (not (and (>= tptp.d 5) (not (>= tptp.d 1)))))) :rule all_simplify)
% 0.61/0.85  (step t270 (cl (= (=> (and (>= tptp.d 5) (not (>= tptp.d 1))) (and (not (>= tptp.d 1)) (>= tptp.d 5))) (not (and (>= tptp.d 5) (not (>= tptp.d 1)))))) :rule trans :premises (t268 t269))
% 0.61/0.85  (step t271 (cl (=> (and (>= tptp.d 5) (not (>= tptp.d 1))) (and (not (>= tptp.d 1)) (>= tptp.d 5))) (and (>= tptp.d 5) (not (>= tptp.d 1)))) :rule implies_neg1)
% 0.61/0.85  (anchor :step t272)
% 0.61/0.85  (assume t272.a0 (>= tptp.d 5))
% 0.61/0.85  (assume t272.a1 (not (>= tptp.d 1)))
% 0.61/0.85  (step t272.t1 (cl (and (not (>= tptp.d 1)) (>= tptp.d 5)) (not (not (>= tptp.d 1))) (not (>= tptp.d 5))) :rule and_neg)
% 0.61/0.85  (step t272.t2 (cl (and (not (>= tptp.d 1)) (>= tptp.d 5))) :rule resolution :premises (t272.t1 t272.a1 t272.a0))
% 0.61/0.85  (step t272 (cl (not (>= tptp.d 5)) (not (not (>= tptp.d 1))) (and (not (>= tptp.d 1)) (>= tptp.d 5))) :rule subproof :discharge (t272.a0 t272.a1))
% 0.61/0.85  (step t273 (cl (not (and (>= tptp.d 5) (not (>= tptp.d 1)))) (>= tptp.d 5)) :rule and_pos)
% 0.61/0.85  (step t274 (cl (not (and (>= tptp.d 5) (not (>= tptp.d 1)))) (not (>= tptp.d 1))) :rule and_pos)
% 0.61/0.85  (step t275 (cl (and (not (>= tptp.d 1)) (>= tptp.d 5)) (not (and (>= tptp.d 5) (not (>= tptp.d 1)))) (not (and (>= tptp.d 5) (not (>= tptp.d 1))))) :rule resolution :premises (t272 t273 t274))
% 0.61/0.85  (step t276 (cl (not (and (>= tptp.d 5) (not (>= tptp.d 1)))) (not (and (>= tptp.d 5) (not (>= tptp.d 1)))) (and (not (>= tptp.d 1)) (>= tptp.d 5))) :rule reordering :premises (t275))
% 0.61/0.85  (step t277 (cl (not (and (>= tptp.d 5) (not (>= tptp.d 1)))) (and (not (>= tptp.d 1)) (>= tptp.d 5))) :rule contraction :premises (t276))
% 0.61/0.85  (step t278 (cl (=> (and (>= tptp.d 5) (not (>= tptp.d 1))) (and (not (>= tptp.d 1)) (>= tptp.d 5))) (and (not (>= tptp.d 1)) (>= tptp.d 5))) :rule resolution :premises (t271 t277))
% 0.61/0.85  (step t279 (cl (=> (and (>= tptp.d 5) (not (>= tptp.d 1))) (and (not (>= tptp.d 1)) (>= tptp.d 5))) (not (and (not (>= tptp.d 1)) (>= tptp.d 5)))) :rule implies_neg2)
% 0.61/0.85  (step t280 (cl (=> (and (>= tptp.d 5) (not (>= tptp.d 1))) (and (not (>= tptp.d 1)) (>= tptp.d 5))) (=> (and (>= tptp.d 5) (not (>= tptp.d 1))) (and (not (>= tptp.d 1)) (>= tptp.d 5)))) :rule resolution :premises (t278 t279))
% 0.61/0.85  (step t281 (cl (=> (and (>= tptp.d 5) (not (>= tptp.d 1))) (and (not (>= tptp.d 1)) (>= tptp.d 5)))) :rule contraction :premises (t280))
% 0.61/0.85  (step t282 (cl (not (and (>= tptp.d 5) (not (>= tptp.d 1))))) :rule resolution :premises (t247 t270 t281))
% 0.61/0.85  (step t283 (cl (not (>= tptp.d 5)) (not (not (>= tptp.d 1)))) :rule not_and :premises (t282))
% 0.61/0.85  (step t284 (cl (or (not (>= tptp.d 5)) (not (not (>= tptp.d 1)))) (not (not (>= tptp.d 5)))) :rule or_neg)
% 0.61/0.85  (step t285 (cl (or (not (>= tptp.d 5)) (not (not (>= tptp.d 1)))) (not (not (not (>= tptp.d 1))))) :rule or_neg)
% 0.61/0.85  (step t286 (cl (or (not (>= tptp.d 5)) (not (not (>= tptp.d 1)))) (or (not (>= tptp.d 5)) (not (not (>= tptp.d 1))))) :rule resolution :premises (t283 t284 t285))
% 0.61/0.85  (step t287 (cl (or (not (>= tptp.d 5)) (not (not (>= tptp.d 1))))) :rule contraction :premises (t286))
% 0.61/0.85  (step t288 (cl (or (not (>= tptp.d 5)) (>= tptp.d 1))) :rule resolution :premises (t235 t246 t287))
% 0.61/0.85  (step t289 (cl (not (>= tptp.d 5)) (>= tptp.d 1)) :rule or :premises (t288))
% 0.61/0.85  (step t290 (cl (not (= (or (= tptp.d 4) (or (not (>= tptp.d 4)) (>= tptp.d 5))) (or (= tptp.d 4) (not (>= tptp.d 4)) (>= tptp.d 5)))) (not (or (= tptp.d 4) (or (not (>= tptp.d 4)) (>= tptp.d 5)))) (or (= tptp.d 4) (not (>= tptp.d 4)) (>= tptp.d 5))) :rule equiv_pos2)
% 0.61/0.85  (step t291 (cl (= (or (= tptp.d 4) (or (not (>= tptp.d 4)) (>= tptp.d 5))) (or (= tptp.d 4) (not (>= tptp.d 4)) (>= tptp.d 5)))) :rule all_simplify)
% 0.61/0.85  (step t292 (cl (not (= (or (not (not (= tptp.d 4))) (not (not (< tptp.d 4))) (not (not (> tptp.d 4)))) (or (= tptp.d 4) (or (not (>= tptp.d 4)) (>= tptp.d 5))))) (not (or (not (not (= tptp.d 4))) (not (not (< tptp.d 4))) (not (not (> tptp.d 4))))) (or (= tptp.d 4) (or (not (>= tptp.d 4)) (>= tptp.d 5)))) :rule equiv_pos2)
% 0.61/0.85  (step t293 (cl (= (not (not (= tptp.d 4))) (= tptp.d 4))) :rule all_simplify)
% 0.61/0.85  (step t294 (cl (= (not (not (< tptp.d 4))) (< tptp.d 4))) :rule all_simplify)
% 0.61/0.85  (step t295 (cl (= (< tptp.d 4) (not (>= tptp.d 4)))) :rule all_simplify)
% 0.61/0.85  (step t296 (cl (= (not (not (< tptp.d 4))) (not (>= tptp.d 4)))) :rule trans :premises (t294 t295))
% 0.61/0.85  (step t297 (cl (= (not (not (> tptp.d 4))) (> tptp.d 4))) :rule all_simplify)
% 0.61/0.85  (step t298 (cl (= (> tptp.d 4) (not (<= tptp.d 4)))) :rule all_simplify)
% 0.61/0.85  (step t299 (cl (= (<= tptp.d 4) (not (>= tptp.d 5)))) :rule all_simplify)
% 0.61/0.85  (step t300 (cl (= (not (<= tptp.d 4)) (not (not (>= tptp.d 5))))) :rule cong :premises (t299))
% 0.61/0.85  (step t301 (cl (= (not (not (>= tptp.d 5))) (>= tptp.d 5))) :rule all_simplify)
% 0.61/0.85  (step t302 (cl (= (not (<= tptp.d 4)) (>= tptp.d 5))) :rule trans :premises (t300 t301))
% 0.61/0.85  (step t303 (cl (= (> tptp.d 4) (>= tptp.d 5))) :rule trans :premises (t298 t302))
% 0.61/0.85  (step t304 (cl (= (not (not (> tptp.d 4))) (>= tptp.d 5))) :rule trans :premises (t297 t303))
% 0.61/0.85  (step t305 (cl (= (or (not (not (= tptp.d 4))) (not (not (< tptp.d 4))) (not (not (> tptp.d 4)))) (or (= tptp.d 4) (not (>= tptp.d 4)) (>= tptp.d 5)))) :rule cong :premises (t293 t296 t304))
% 0.61/0.85  (step t306 (cl (= (or (= tptp.d 4) (or (not (>= tptp.d 4)) (>= tptp.d 5))) (or (= tptp.d 4) (not (>= tptp.d 4)) (>= tptp.d 5)))) :rule all_simplify)
% 0.61/0.85  (step t307 (cl (= (or (= tptp.d 4) (not (>= tptp.d 4)) (>= tptp.d 5)) (or (= tptp.d 4) (or (not (>= tptp.d 4)) (>= tptp.d 5))))) :rule symm :premises (t306))
% 0.61/0.85  (step t308 (cl (= (or (not (not (= tptp.d 4))) (not (not (< tptp.d 4))) (not (not (> tptp.d 4)))) (or (= tptp.d 4) (or (not (>= tptp.d 4)) (>= tptp.d 5))))) :rule trans :premises (t305 t307))
% 0.61/0.85  (step t309 (cl (=> (and (not (= tptp.d 4)) (not (< tptp.d 4)) (not (> tptp.d 4))) false) (and (not (= tptp.d 4)) (not (< tptp.d 4)) (not (> tptp.d 4)))) :rule implies_neg1)
% 0.61/0.85  (anchor :step t310)
% 0.61/0.85  (assume t310.a0 (not (= tptp.d 4)))
% 0.61/0.85  (assume t310.a1 (not (< tptp.d 4)))
% 0.61/0.85  (assume t310.a2 (not (> tptp.d 4)))
% 0.61/0.85  (step t310.t1 (cl (or (= tptp.d 4) (not (<= tptp.d 4)) (not (<= 4 tptp.d)))) :rule la_disequality)
% 0.61/0.85  (step t310.t2 (cl (= tptp.d 4) (not (<= tptp.d 4)) (not (<= 4 tptp.d))) :rule or :premises (t310.t1))
% 0.61/0.85  (step t310.t3 (cl (not (= (>= tptp.d 4) (<= 4 tptp.d))) (not (>= tptp.d 4)) (<= 4 tptp.d)) :rule equiv_pos2)
% 0.61/0.85  (step t310.t4 (cl (= (>= tptp.d 4) (<= 4 tptp.d))) :rule comp_simplify)
% 0.61/0.85  (step t310.t5 (cl (<= 4 tptp.d)) :rule resolution :premises (t310.t3 t310.t4 t310.a0))
% 0.61/0.85  (step t310.t6 (cl (not (<= tptp.d 4))) :rule resolution :premises (t310.t2 t310.t5 t310.a1))
% 0.61/0.85  (step t310.t7 (cl (not (= (> tptp.d 4) (not (<= tptp.d 4)))) (> tptp.d 4) (not (not (<= tptp.d 4)))) :rule equiv_pos1)
% 0.61/0.85  (step t310.t8 (cl (= (> tptp.d 4) (not (<= tptp.d 4)))) :rule comp_simplify)
% 0.61/0.85  (step t310.t9 (cl (> tptp.d 4)) :rule resolution :premises (t310.t6 t310.t7 t310.t8))
% 0.61/0.85  (step t310.t10 (cl) :rule resolution :premises (t310.t9 t310.a2))
% 0.61/0.85  (step t310 (cl (not (not (= tptp.d 4))) (not (not (< tptp.d 4))) (not (not (> tptp.d 4))) false) :rule subproof :discharge (t310.a0 t310.a1 t310.a2))
% 0.61/0.85  (step t311 (cl (not (and (not (= tptp.d 4)) (not (< tptp.d 4)) (not (> tptp.d 4)))) (not (= tptp.d 4))) :rule and_pos)
% 0.61/0.85  (step t312 (cl (not (and (not (= tptp.d 4)) (not (< tptp.d 4)) (not (> tptp.d 4)))) (not (< tptp.d 4))) :rule and_pos)
% 0.61/0.85  (step t313 (cl (not (and (not (= tptp.d 4)) (not (< tptp.d 4)) (not (> tptp.d 4)))) (not (> tptp.d 4))) :rule and_pos)
% 0.61/0.85  (step t314 (cl false (not (and (not (= tptp.d 4)) (not (< tptp.d 4)) (not (> tptp.d 4)))) (not (and (not (= tptp.d 4)) (not (< tptp.d 4)) (not (> tptp.d 4)))) (not (and (not (= tptp.d 4)) (not (< tptp.d 4)) (not (> tptp.d 4))))) :rule resolution :premises (t310 t311 t312 t313))
% 0.61/0.85  (step t315 (cl (not (and (not (= tptp.d 4)) (not (< tptp.d 4)) (not (> tptp.d 4)))) (not (and (not (= tptp.d 4)) (not (< tptp.d 4)) (not (> tptp.d 4)))) (not (and (not (= tptp.d 4)) (not (< tptp.d 4)) (not (> tptp.d 4)))) false) :rule reordering :premises (t314))
% 0.61/0.85  (step t316 (cl (not (and (not (= tptp.d 4)) (not (< tptp.d 4)) (not (> tptp.d 4)))) false) :rule contraction :premises (t315))
% 0.61/0.85  (step t317 (cl (=> (and (not (= tptp.d 4)) (not (< tptp.d 4)) (not (> tptp.d 4))) false) false) :rule resolution :premises (t309 t316))
% 0.61/0.85  (step t318 (cl (=> (and (not (= tptp.d 4)) (not (< tptp.d 4)) (not (> tptp.d 4))) false) (not false)) :rule implies_neg2)
% 0.61/0.85  (step t319 (cl (=> (and (not (= tptp.d 4)) (not (< tptp.d 4)) (not (> tptp.d 4))) false) (=> (and (not (= tptp.d 4)) (not (< tptp.d 4)) (not (> tptp.d 4))) false)) :rule resolution :premises (t317 t318))
% 0.61/0.85  (step t320 (cl (=> (and (not (= tptp.d 4)) (not (< tptp.d 4)) (not (> tptp.d 4))) false)) :rule contraction :premises (t319))
% 0.61/0.85  (step t321 (cl (= (=> (and (not (= tptp.d 4)) (not (< tptp.d 4)) (not (> tptp.d 4))) false) (not (and (not (= tptp.d 4)) (not (< tptp.d 4)) (not (> tptp.d 4)))))) :rule implies_simplify)
% 0.61/0.85  (step t322 (cl (not (=> (and (not (= tptp.d 4)) (not (< tptp.d 4)) (not (> tptp.d 4))) false)) (not (and (not (= tptp.d 4)) (not (< tptp.d 4)) (not (> tptp.d 4))))) :rule equiv1 :premises (t321))
% 0.61/0.85  (step t323 (cl (not (and (not (= tptp.d 4)) (not (< tptp.d 4)) (not (> tptp.d 4))))) :rule resolution :premises (t320 t322))
% 0.61/0.85  (step t324 (cl (not (not (= tptp.d 4))) (not (not (< tptp.d 4))) (not (not (> tptp.d 4)))) :rule not_and :premises (t323))
% 0.61/0.85  (step t325 (cl (or (not (not (= tptp.d 4))) (not (not (< tptp.d 4))) (not (not (> tptp.d 4)))) (not (not (not (= tptp.d 4))))) :rule or_neg)
% 0.61/0.85  (step t326 (cl (or (not (not (= tptp.d 4))) (not (not (< tptp.d 4))) (not (not (> tptp.d 4)))) (not (not (not (< tptp.d 4))))) :rule or_neg)
% 0.61/0.85  (step t327 (cl (or (not (not (= tptp.d 4))) (not (not (< tptp.d 4))) (not (not (> tptp.d 4)))) (not (not (not (> tptp.d 4))))) :rule or_neg)
% 0.61/0.85  (step t328 (cl (or (not (not (= tptp.d 4))) (not (not (< tptp.d 4))) (not (not (> tptp.d 4)))) (or (not (not (= tptp.d 4))) (not (not (< tptp.d 4))) (not (not (> tptp.d 4)))) (or (not (not (= tptp.d 4))) (not (not (< tptp.d 4))) (not (not (> tptp.d 4))))) :rule resolution :premises (t324 t325 t326 t327))
% 0.61/0.85  (step t329 (cl (or (not (not (= tptp.d 4))) (not (not (< tptp.d 4))) (not (not (> tptp.d 4))))) :rule contraction :premises (t328))
% 0.61/0.85  (step t330 (cl (or (= tptp.d 4) (or (not (>= tptp.d 4)) (>= tptp.d 5)))) :rule resolution :premises (t292 t308 t329))
% 0.61/0.85  (step t331 (cl (or (= tptp.d 4) (not (>= tptp.d 4)) (>= tptp.d 5))) :rule resolution :premises (t290 t291 t330))
% 0.61/0.85  (step t332 (cl (= tptp.d 4) (not (>= tptp.d 4)) (>= tptp.d 5)) :rule or :premises (t331))
% 0.61/0.85  (step t333 (cl (not (>= tptp.d 4)) (>= tptp.d 5) (= tptp.d 4)) :rule reordering :premises (t332))
% 0.61/0.85  (step t334 (cl (not (= (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= tptp.d 4))) (not (= (* tptp.d tptp.c) (* 3 tptp.c)))) (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (>= tptp.d 4) (not (= (* tptp.d tptp.c) (* 3 tptp.c)))))) (not (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= tptp.d 4))) (not (= (* tptp.d tptp.c) (* 3 tptp.c))))) (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (>= tptp.d 4) (not (= (* tptp.d tptp.c) (* 3 tptp.c))))) :rule equiv_pos2)
% 0.61/0.85  (step t335 (cl (= (= (= (not (not (>= tptp.d 4))) (>= tptp.d 4)) true) (= (not (not (>= tptp.d 4))) (>= tptp.d 4)))) :rule equiv_simplify)
% 0.61/0.85  (step t336 (cl (not (= (= (not (not (>= tptp.d 4))) (>= tptp.d 4)) true)) (= (not (not (>= tptp.d 4))) (>= tptp.d 4))) :rule equiv1 :premises (t335))
% 0.61/0.85  (step t337 (cl (= (= (not (not (>= tptp.d 4))) (>= tptp.d 4)) (= (>= tptp.d 4) (not (not (>= tptp.d 4)))))) :rule all_simplify)
% 0.61/0.85  (step t338 (cl (= (>= tptp.d 4) (>= tptp.d 4))) :rule refl)
% 0.61/0.85  (step t339 (cl (= (not (not (>= tptp.d 4))) (>= tptp.d 4))) :rule all_simplify)
% 0.61/0.85  (step t340 (cl (= (= (>= tptp.d 4) (not (not (>= tptp.d 4)))) (= (>= tptp.d 4) (>= tptp.d 4)))) :rule cong :premises (t338 t339))
% 0.61/0.85  (step t341 (cl (= (= (>= tptp.d 4) (>= tptp.d 4)) true)) :rule all_simplify)
% 0.61/0.85  (step t342 (cl (= (= (>= tptp.d 4) (not (not (>= tptp.d 4)))) true)) :rule trans :premises (t340 t341))
% 0.61/0.85  (step t343 (cl (= (= (not (not (>= tptp.d 4))) (>= tptp.d 4)) true)) :rule trans :premises (t337 t342))
% 0.61/0.85  (step t344 (cl (= (not (not (>= tptp.d 4))) (>= tptp.d 4))) :rule resolution :premises (t336 t343))
% 0.61/0.85  (step t345 (cl (= (not (= (* tptp.d tptp.c) (* 3 tptp.c))) (not (= (* tptp.d tptp.c) (* 3 tptp.c))))) :rule refl)
% 0.61/0.85  (step t346 (cl (= (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= tptp.d 4))) (not (= (* tptp.d tptp.c) (* 3 tptp.c)))) (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (>= tptp.d 4) (not (= (* tptp.d tptp.c) (* 3 tptp.c)))))) :rule cong :premises (t46 t344 t345))
% 0.61/0.85  (step t347 (cl (not (= (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= tptp.d 4)) (= (* tptp.d tptp.c) (* 3 tptp.c))) (and (not (>= tptp.d 4)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 3 tptp.c)))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= tptp.d 4)) (= (* tptp.d tptp.c) (* 3 tptp.c)))))) (not (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= tptp.d 4)) (= (* tptp.d tptp.c) (* 3 tptp.c))) (and (not (>= tptp.d 4)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 3 tptp.c))))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= tptp.d 4)) (= (* tptp.d tptp.c) (* 3 tptp.c))))) :rule equiv_pos2)
% 0.61/0.85  (step t348 (cl (= (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= tptp.d 4)) (= (* tptp.d tptp.c) (* 3 tptp.c))) (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= tptp.d 4)) (= (* tptp.d tptp.c) (* 3 tptp.c))))) :rule refl)
% 0.61/0.85  (step t349 (cl (= (= (and (not (>= tptp.d 4)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 3 tptp.c))) false) (not (and (not (>= tptp.d 4)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 3 tptp.c)))))) :rule equiv_simplify)
% 0.61/0.85  (step t350 (cl (= (and (not (>= tptp.d 4)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 3 tptp.c))) false) (not (not (and (not (>= tptp.d 4)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 3 tptp.c)))))) :rule equiv2 :premises (t349))
% 0.61/0.85  (step t351 (cl (not (not (not (and (not (>= tptp.d 4)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 3 tptp.c)))))) (and (not (>= tptp.d 4)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 3 tptp.c)))) :rule not_not)
% 0.61/0.85  (step t352 (cl (= (and (not (>= tptp.d 4)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 3 tptp.c))) false) (and (not (>= tptp.d 4)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 3 tptp.c)))) :rule resolution :premises (t350 t351))
% 0.61/0.85  (step t353 (cl (=> (and (not (>= tptp.d 4)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 3 tptp.c))) false) (and (not (>= tptp.d 4)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 3 tptp.c)))) :rule implies_neg1)
% 0.61/0.85  (anchor :step t354)
% 0.61/0.85  (assume t354.a0 (not (>= tptp.d 4)))
% 0.61/0.85  (assume t354.a1 (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))
% 0.61/0.85  (assume t354.a2 (= (* tptp.d tptp.c) (* 3 tptp.c)))
% 0.61/0.85  (step t354.t1 (cl (not (= (= (* tptp.d tptp.c) (* 3 tptp.c)) (= (+ (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 0))) (not (= (* tptp.d tptp.c) (* 3 tptp.c))) (= (+ (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 0)) :rule equiv_pos2)
% 0.61/0.85  (step t354.t2 (cl (= (= (+ (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 0) (= (* tptp.d tptp.c) (* 3 tptp.c)))) :rule all_simplify)
% 0.61/0.85  (step t354.t3 (cl (= (= (* tptp.d tptp.c) (* 3 tptp.c)) (= (+ (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 0))) :rule symm :premises (t354.t2))
% 0.61/0.85  (step t354.t4 (cl (= (+ (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 0)) :rule resolution :premises (t354.t1 t354.t3 t354.a2))
% 0.61/0.85  (step t354.t5 (cl (=> (= (+ (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 0) false) (= (+ (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 0)) :rule implies_neg1)
% 0.61/0.85  (anchor :step t354.t6)
% 0.61/0.85  (assume t354.t6.a0 (= (+ (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 0))
% 0.61/0.85  (step t354.t6.t1 (cl (not (= (<= (+ (* 1.0 (+ (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 2.0 tptp.d)) (+ (* 1.0 0) (* (- 1.0) 7) (* 2.0 3))) false)) (not (<= (+ (* 1.0 (+ (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 2.0 tptp.d)) (+ (* 1.0 0) (* (- 1.0) 7) (* 2.0 3)))) false) :rule equiv_pos2)
% 0.61/0.85  (step t354.t6.t2 (cl (= (* 1.0 (+ (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (to_real (+ (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))))) :rule all_simplify)
% 0.61/0.85  (step t354.t6.t3 (cl (= (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (to_real (+ (* (- 2) tptp.d) (* (- 3) tptp.c) (* tptp.d tptp.c))))) :rule all_simplify)
% 0.61/0.85  (step t354.t6.t4 (cl (= (* 2.0 tptp.d) (to_real (* 2 tptp.d)))) :rule all_simplify)
% 0.61/0.85  (step t354.t6.t5 (cl (= (+ (* 1.0 (+ (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 2.0 tptp.d)) (+ (to_real (+ (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (to_real (+ (* (- 2) tptp.d) (* (- 3) tptp.c) (* tptp.d tptp.c))) (to_real (* 2 tptp.d))))) :rule cong :premises (t354.t6.t2 t354.t6.t3 t354.t6.t4))
% 0.61/0.85  (step t354.t6.t6 (cl (= (+ (to_real (+ (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (to_real (+ (* (- 2) tptp.d) (* (- 3) tptp.c) (* tptp.d tptp.c))) (to_real (* 2 tptp.d))) 0.0)) :rule all_simplify)
% 0.61/0.85  (step t354.t6.t7 (cl (= (+ (* 1.0 (+ (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 2.0 tptp.d)) 0.0)) :rule trans :premises (t354.t6.t5 t354.t6.t6))
% 0.61/0.85  (step t354.t6.t8 (cl (= (* 1.0 0) 0.0)) :rule all_simplify)
% 0.61/0.85  (step t354.t6.t9 (cl (= (* (- 1.0) 7) (- 7.0))) :rule all_simplify)
% 0.61/0.85  (step t354.t6.t10 (cl (= (* 2.0 3) 6.0)) :rule all_simplify)
% 0.61/0.85  (step t354.t6.t11 (cl (= (+ (* 1.0 0) (* (- 1.0) 7) (* 2.0 3)) (+ 0.0 (- 7.0) 6.0))) :rule cong :premises (t354.t6.t8 t354.t6.t9 t354.t6.t10))
% 0.61/0.85  (step t354.t6.t12 (cl (= (+ 0.0 (- 7.0) 6.0) (- 1.0))) :rule all_simplify)
% 0.61/0.85  (step t354.t6.t13 (cl (= (+ (* 1.0 0) (* (- 1.0) 7) (* 2.0 3)) (- 1.0))) :rule trans :premises (t354.t6.t11 t354.t6.t12))
% 0.61/0.85  (step t354.t6.t14 (cl (= (<= (+ (* 1.0 (+ (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 2.0 tptp.d)) (+ (* 1.0 0) (* (- 1.0) 7) (* 2.0 3))) (<= 0.0 (- 1.0)))) :rule cong :premises (t354.t6.t7 t354.t6.t13))
% 0.61/0.85  (step t354.t6.t15 (cl (= (<= 0.0 (- 1.0)) false)) :rule all_simplify)
% 0.61/0.85  (step t354.t6.t16 (cl (= (<= (+ (* 1.0 (+ (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 2.0 tptp.d)) (+ (* 1.0 0) (* (- 1.0) 7) (* 2.0 3))) false)) :rule trans :premises (t354.t6.t14 t354.t6.t15))
% 0.61/0.85  (step t354.t6.t17 (cl (not (= (* 1.0 (+ (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 1.0 0))) (not (<= (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) 7))) (not (<= (* 2.0 tptp.d) (* 2.0 3))) (<= (+ (* 1.0 (+ (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 2.0 tptp.d)) (+ (* 1.0 0) (* (- 1.0) 7) (* 2.0 3)))) :rule la_generic :args ((- 1) 1 1 1))
% 0.61/0.85  (step t354.t6.t18 (cl (=> (and (> 1.0 0) (= (+ (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 0)) (= (* 1.0 (+ (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 1.0 0)))) :rule la_mult_pos)
% 0.61/0.85  (step t354.t6.t19 (cl (not (and (> 1.0 0) (= (+ (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 0))) (= (* 1.0 (+ (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 1.0 0))) :rule implies :premises (t354.t6.t18))
% 0.61/0.85  (step t354.t6.t20 (cl (and (> 1.0 0) (= (+ (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 0)) (not (> 1.0 0)) (not (= (+ (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 0))) :rule and_neg)
% 0.61/0.85  (step t354.t6.t21 (cl (= (= (> 1.0 0) true) (> 1.0 0))) :rule equiv_simplify)
% 0.61/0.85  (step t354.t6.t22 (cl (not (= (> 1.0 0) true)) (> 1.0 0)) :rule equiv1 :premises (t354.t6.t21))
% 0.61/0.85  (step t354.t6.t23 (cl (= (> 1.0 0) true)) :rule hole :args ((> 1.0 0)))
% 0.61/0.85  (step t354.t6.t24 (cl (> 1.0 0)) :rule resolution :premises (t354.t6.t22 t354.t6.t23))
% 0.61/0.85  (step t354.t6.t25 (cl (and (> 1.0 0) (= (+ (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 0))) :rule resolution :premises (t354.t6.t20 t354.t6.t24 t354.t6.a0))
% 0.61/0.85  (step t354.t6.t26 (cl (= (* 1.0 (+ (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 1.0 0))) :rule resolution :premises (t354.t6.t19 t354.t6.t25))
% 0.61/0.85  (step t354.t6.t27 (cl (=> (and (< (- 1.0) 0) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (<= (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) 7)))) :rule la_mult_neg)
% 0.61/0.85  (step t354.t6.t28 (cl (not (and (< (- 1.0) 0) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (<= (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) 7))) :rule implies :premises (t354.t6.t27))
% 0.61/0.85  (step t354.t6.t29 (cl (and (< (- 1.0) 0) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (< (- 1.0) 0)) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule and_neg)
% 0.61/0.85  (step t354.t6.t30 (cl (= (= (< (- 1.0) 0) true) (< (- 1.0) 0))) :rule equiv_simplify)
% 0.61/0.85  (step t354.t6.t31 (cl (not (= (< (- 1.0) 0) true)) (< (- 1.0) 0)) :rule equiv1 :premises (t354.t6.t30))
% 0.61/0.85  (step t354.t6.t32 (cl (= (< (- 1.0) 0) true)) :rule hole :args ((< (- 1.0) 0)))
% 0.61/0.85  (step t354.t6.t33 (cl (< (- 1.0) 0)) :rule resolution :premises (t354.t6.t31 t354.t6.t32))
% 0.61/0.85  (step t354.t6.t34 (cl (and (< (- 1.0) 0) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule resolution :premises (t354.t6.t29 t354.t6.t33 t354.a1))
% 0.61/0.85  (step t354.t6.t35 (cl (<= (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) 7))) :rule resolution :premises (t354.t6.t28 t354.t6.t34))
% 0.61/0.85  (step t354.t6.t36 (cl (=> (and (> 2.0 0) (<= tptp.d 3)) (<= (* 2.0 tptp.d) (* 2.0 3)))) :rule la_mult_pos)
% 0.61/0.85  (step t354.t6.t37 (cl (not (and (> 2.0 0) (<= tptp.d 3))) (<= (* 2.0 tptp.d) (* 2.0 3))) :rule implies :premises (t354.t6.t36))
% 0.61/0.85  (step t354.t6.t38 (cl (and (> 2.0 0) (<= tptp.d 3)) (not (> 2.0 0)) (not (<= tptp.d 3))) :rule and_neg)
% 0.61/0.85  (step t354.t6.t39 (cl (= (= (> 2.0 0) true) (> 2.0 0))) :rule equiv_simplify)
% 0.61/0.85  (step t354.t6.t40 (cl (not (= (> 2.0 0) true)) (> 2.0 0)) :rule equiv1 :premises (t354.t6.t39))
% 0.61/0.85  (step t354.t6.t41 (cl (= (> 2.0 0) true)) :rule hole :args ((> 2.0 0)))
% 0.61/0.85  (step t354.t6.t42 (cl (> 2.0 0)) :rule resolution :premises (t354.t6.t40 t354.t6.t41))
% 0.61/0.85  (step t354.t6.t43 (cl (not (< tptp.d 4)) (<= tptp.d 3)) :rule la_generic :args (1 1))
% 0.61/0.85  (step t354.t6.t44 (cl (not (= (not (>= tptp.d 4)) (< tptp.d 4))) (not (not (>= tptp.d 4))) (< tptp.d 4)) :rule equiv_pos2)
% 0.61/0.85  (step t354.t6.t45 (cl (= (not (>= tptp.d 4)) (< tptp.d 4))) :rule symm :premises (t295))
% 0.61/0.85  (step t354.t6.t46 (cl (< tptp.d 4)) :rule resolution :premises (t354.t6.t44 t354.t6.t45 t354.a0))
% 0.61/0.85  (step t354.t6.t47 (cl (<= tptp.d 3)) :rule resolution :premises (t354.t6.t43 t354.t6.t46))
% 0.61/0.85  (step t354.t6.t48 (cl (and (> 2.0 0) (<= tptp.d 3))) :rule resolution :premises (t354.t6.t38 t354.t6.t42 t354.t6.t47))
% 0.61/0.85  (step t354.t6.t49 (cl (<= (* 2.0 tptp.d) (* 2.0 3))) :rule resolution :premises (t354.t6.t37 t354.t6.t48))
% 0.61/0.85  (step t354.t6.t50 (cl (<= (+ (* 1.0 (+ (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 2.0 tptp.d)) (+ (* 1.0 0) (* (- 1.0) 7) (* 2.0 3)))) :rule resolution :premises (t354.t6.t17 t354.t6.t26 t354.t6.t35 t354.t6.t49))
% 0.61/0.85  (step t354.t6.t51 (cl false) :rule resolution :premises (t354.t6.t1 t354.t6.t16 t354.t6.t50))
% 0.61/0.85  (step t354.t6 (cl (not (= (+ (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 0)) false) :rule subproof :discharge (t354.t6.a0))
% 0.61/0.85  (step t354.t7 (cl (=> (= (+ (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 0) false) false) :rule resolution :premises (t354.t5 t354.t6))
% 0.61/0.85  (step t354.t8 (cl (=> (= (+ (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 0) false) (not false)) :rule implies_neg2)
% 0.61/0.85  (step t354.t9 (cl (=> (= (+ (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 0) false) (=> (= (+ (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 0) false)) :rule resolution :premises (t354.t7 t354.t8))
% 0.61/0.85  (step t354.t10 (cl (=> (= (+ (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 0) false)) :rule contraction :premises (t354.t9))
% 0.61/0.85  (step t354.t11 (cl (= (=> (= (+ (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 0) false) (not (= (+ (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 0)))) :rule implies_simplify)
% 0.61/0.85  (step t354.t12 (cl (not (=> (= (+ (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 0) false)) (not (= (+ (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 0))) :rule equiv1 :premises (t354.t11))
% 0.61/0.85  (step t354.t13 (cl (not (= (+ (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 0))) :rule resolution :premises (t354.t10 t354.t12))
% 0.61/0.85  (step t354.t14 (cl) :rule resolution :premises (t354.t4 t354.t13))
% 0.61/0.85  (step t354 (cl (not (not (>= tptp.d 4))) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (= (* tptp.d tptp.c) (* 3 tptp.c))) false) :rule subproof :discharge (t354.a0 t354.a1 t354.a2))
% 0.61/0.85  (step t355 (cl (not (and (not (>= tptp.d 4)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 3 tptp.c)))) (not (>= tptp.d 4))) :rule and_pos)
% 0.61/0.85  (step t356 (cl (not (and (not (>= tptp.d 4)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 3 tptp.c)))) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) :rule and_pos)
% 0.61/0.85  (step t357 (cl (not (and (not (>= tptp.d 4)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 3 tptp.c)))) (= (* tptp.d tptp.c) (* 3 tptp.c))) :rule and_pos)
% 0.61/0.85  (step t358 (cl false (not (and (not (>= tptp.d 4)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 3 tptp.c)))) (not (and (not (>= tptp.d 4)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 3 tptp.c)))) (not (and (not (>= tptp.d 4)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 3 tptp.c))))) :rule resolution :premises (t354 t355 t356 t357))
% 0.61/0.85  (step t359 (cl (not (and (not (>= tptp.d 4)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 3 tptp.c)))) (not (and (not (>= tptp.d 4)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 3 tptp.c)))) (not (and (not (>= tptp.d 4)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 3 tptp.c)))) false) :rule reordering :premises (t358))
% 0.61/0.85  (step t360 (cl (not (and (not (>= tptp.d 4)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 3 tptp.c)))) false) :rule contraction :premises (t359))
% 0.61/0.85  (step t361 (cl (=> (and (not (>= tptp.d 4)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 3 tptp.c))) false) false) :rule resolution :premises (t353 t360))
% 0.61/0.85  (step t362 (cl (=> (and (not (>= tptp.d 4)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 3 tptp.c))) false) (not false)) :rule implies_neg2)
% 0.61/0.85  (step t363 (cl (=> (and (not (>= tptp.d 4)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 3 tptp.c))) false) (=> (and (not (>= tptp.d 4)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 3 tptp.c))) false)) :rule resolution :premises (t361 t362))
% 0.61/0.85  (step t364 (cl (=> (and (not (>= tptp.d 4)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 3 tptp.c))) false)) :rule contraction :premises (t363))
% 0.61/0.85  (step t365 (cl (= (=> (and (not (>= tptp.d 4)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 3 tptp.c))) false) (not (and (not (>= tptp.d 4)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 3 tptp.c)))))) :rule implies_simplify)
% 0.61/0.85  (step t366 (cl (not (=> (and (not (>= tptp.d 4)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 3 tptp.c))) false)) (not (and (not (>= tptp.d 4)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 3 tptp.c))))) :rule equiv1 :premises (t365))
% 0.61/0.85  (step t367 (cl (not (and (not (>= tptp.d 4)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 3 tptp.c))))) :rule resolution :premises (t364 t366))
% 0.61/0.85  (step t368 (cl (= (and (not (>= tptp.d 4)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 3 tptp.c))) false)) :rule resolution :premises (t352 t367))
% 0.61/0.85  (step t369 (cl (= (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= tptp.d 4)) (= (* tptp.d tptp.c) (* 3 tptp.c))) (and (not (>= tptp.d 4)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 3 tptp.c)))) (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= tptp.d 4)) (= (* tptp.d tptp.c) (* 3 tptp.c))) false))) :rule cong :premises (t348 t368))
% 0.61/0.85  (step t370 (cl (= (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= tptp.d 4)) (= (* tptp.d tptp.c) (* 3 tptp.c))) false) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= tptp.d 4)) (= (* tptp.d tptp.c) (* 3 tptp.c)))))) :rule all_simplify)
% 0.61/0.85  (step t371 (cl (= (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= tptp.d 4)) (= (* tptp.d tptp.c) (* 3 tptp.c))) (and (not (>= tptp.d 4)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 3 tptp.c)))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= tptp.d 4)) (= (* tptp.d tptp.c) (* 3 tptp.c)))))) :rule trans :premises (t369 t370))
% 0.61/0.85  (step t372 (cl (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= tptp.d 4)) (= (* tptp.d tptp.c) (* 3 tptp.c))) (and (not (>= tptp.d 4)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 3 tptp.c)))) (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= tptp.d 4)) (= (* tptp.d tptp.c) (* 3 tptp.c)))) :rule implies_neg1)
% 0.61/0.85  (anchor :step t373)
% 0.61/0.85  (assume t373.a0 (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))
% 0.61/0.85  (assume t373.a1 (not (>= tptp.d 4)))
% 0.61/0.85  (assume t373.a2 (= (* tptp.d tptp.c) (* 3 tptp.c)))
% 0.61/0.85  (step t373.t1 (cl (and (not (>= tptp.d 4)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 3 tptp.c))) (not (not (>= tptp.d 4))) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (= (* tptp.d tptp.c) (* 3 tptp.c)))) :rule and_neg)
% 0.61/0.85  (step t373.t2 (cl (and (not (>= tptp.d 4)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 3 tptp.c)))) :rule resolution :premises (t373.t1 t373.a1 t373.a0 t373.a2))
% 0.61/0.85  (step t373 (cl (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= tptp.d 4))) (not (= (* tptp.d tptp.c) (* 3 tptp.c))) (and (not (>= tptp.d 4)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 3 tptp.c)))) :rule subproof :discharge (t373.a0 t373.a1 t373.a2))
% 0.61/0.85  (step t374 (cl (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= tptp.d 4)) (= (* tptp.d tptp.c) (* 3 tptp.c)))) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) :rule and_pos)
% 0.61/0.85  (step t375 (cl (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= tptp.d 4)) (= (* tptp.d tptp.c) (* 3 tptp.c)))) (not (>= tptp.d 4))) :rule and_pos)
% 0.61/0.85  (step t376 (cl (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= tptp.d 4)) (= (* tptp.d tptp.c) (* 3 tptp.c)))) (= (* tptp.d tptp.c) (* 3 tptp.c))) :rule and_pos)
% 0.61/0.85  (step t377 (cl (and (not (>= tptp.d 4)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 3 tptp.c))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= tptp.d 4)) (= (* tptp.d tptp.c) (* 3 tptp.c)))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= tptp.d 4)) (= (* tptp.d tptp.c) (* 3 tptp.c)))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= tptp.d 4)) (= (* tptp.d tptp.c) (* 3 tptp.c))))) :rule resolution :premises (t373 t374 t375 t376))
% 0.61/0.85  (step t378 (cl (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= tptp.d 4)) (= (* tptp.d tptp.c) (* 3 tptp.c)))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= tptp.d 4)) (= (* tptp.d tptp.c) (* 3 tptp.c)))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= tptp.d 4)) (= (* tptp.d tptp.c) (* 3 tptp.c)))) (and (not (>= tptp.d 4)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 3 tptp.c)))) :rule reordering :premises (t377))
% 0.61/0.85  (step t379 (cl (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= tptp.d 4)) (= (* tptp.d tptp.c) (* 3 tptp.c)))) (and (not (>= tptp.d 4)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 3 tptp.c)))) :rule contraction :premises (t378))
% 0.61/0.85  (step t380 (cl (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= tptp.d 4)) (= (* tptp.d tptp.c) (* 3 tptp.c))) (and (not (>= tptp.d 4)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 3 tptp.c)))) (and (not (>= tptp.d 4)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 3 tptp.c)))) :rule resolution :premises (t372 t379))
% 0.61/0.85  (step t381 (cl (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= tptp.d 4)) (= (* tptp.d tptp.c) (* 3 tptp.c))) (and (not (>= tptp.d 4)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 3 tptp.c)))) (not (and (not (>= tptp.d 4)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 3 tptp.c))))) :rule implies_neg2)
% 0.61/0.85  (step t382 (cl (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= tptp.d 4)) (= (* tptp.d tptp.c) (* 3 tptp.c))) (and (not (>= tptp.d 4)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 3 tptp.c)))) (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= tptp.d 4)) (= (* tptp.d tptp.c) (* 3 tptp.c))) (and (not (>= tptp.d 4)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 3 tptp.c))))) :rule resolution :premises (t380 t381))
% 0.61/0.85  (step t383 (cl (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= tptp.d 4)) (= (* tptp.d tptp.c) (* 3 tptp.c))) (and (not (>= tptp.d 4)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 3 tptp.c))))) :rule contraction :premises (t382))
% 0.61/0.85  (step t384 (cl (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= tptp.d 4)) (= (* tptp.d tptp.c) (* 3 tptp.c))))) :rule resolution :premises (t347 t371 t383))
% 0.61/0.85  (step t385 (cl (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= tptp.d 4))) (not (= (* tptp.d tptp.c) (* 3 tptp.c)))) :rule not_and :premises (t384))
% 0.61/0.85  (step t386 (cl (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= tptp.d 4))) (not (= (* tptp.d tptp.c) (* 3 tptp.c)))) (not (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)))) :rule or_neg)
% 0.61/0.85  (step t387 (cl (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= tptp.d 4))) (not (= (* tptp.d tptp.c) (* 3 tptp.c)))) (not (not (not (>= tptp.d 4))))) :rule or_neg)
% 0.61/0.85  (step t388 (cl (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= tptp.d 4))) (not (= (* tptp.d tptp.c) (* 3 tptp.c)))) (not (not (= (* tptp.d tptp.c) (* 3 tptp.c))))) :rule or_neg)
% 0.61/0.85  (step t389 (cl (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= tptp.d 4))) (not (= (* tptp.d tptp.c) (* 3 tptp.c)))) (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= tptp.d 4))) (not (= (* tptp.d tptp.c) (* 3 tptp.c)))) (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= tptp.d 4))) (not (= (* tptp.d tptp.c) (* 3 tptp.c))))) :rule resolution :premises (t385 t386 t387 t388))
% 0.61/0.85  (step t390 (cl (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= tptp.d 4))) (not (= (* tptp.d tptp.c) (* 3 tptp.c))))) :rule contraction :premises (t389))
% 0.61/0.85  (step t391 (cl (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (>= tptp.d 4) (not (= (* tptp.d tptp.c) (* 3 tptp.c))))) :rule resolution :premises (t334 t346 t390))
% 0.61/0.85  (step t392 (cl (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (>= tptp.d 4) (not (= (* tptp.d tptp.c) (* 3 tptp.c)))) :rule or :premises (t391))
% 0.61/0.85  (step t393 (cl (or (not (= tptp.d 3)) (= (* tptp.d tptp.c) (* 3 tptp.c)))) :rule hole :args ((or (not (= tptp.d 3)) (= (* tptp.d tptp.c) (* 3 tptp.c))) 3))
% 0.61/0.85  (step t394 (cl (not (= tptp.d 3)) (= (* tptp.d tptp.c) (* 3 tptp.c))) :rule or :premises (t393))
% 0.61/0.85  (step t395 (cl (not (= (or (not (>= tptp.d 3)) (not (not (>= tptp.d 4))) (not (not (= tptp.d 3)))) (or (not (>= tptp.d 3)) (>= tptp.d 4) (= tptp.d 3)))) (not (or (not (>= tptp.d 3)) (not (not (>= tptp.d 4))) (not (not (= tptp.d 3))))) (or (not (>= tptp.d 3)) (>= tptp.d 4) (= tptp.d 3))) :rule equiv_pos2)
% 0.61/0.85  (step t396 (cl (= (= (= (not (not (= tptp.d 3))) (= tptp.d 3)) true) (= (not (not (= tptp.d 3))) (= tptp.d 3)))) :rule equiv_simplify)
% 0.61/0.85  (step t397 (cl (not (= (= (not (not (= tptp.d 3))) (= tptp.d 3)) true)) (= (not (not (= tptp.d 3))) (= tptp.d 3))) :rule equiv1 :premises (t396))
% 0.61/0.85  (step t398 (cl (= (= (not (not (= tptp.d 3))) (= tptp.d 3)) (= (= tptp.d 3) (not (not (= tptp.d 3)))))) :rule all_simplify)
% 0.61/0.85  (step t399 (cl (= (= tptp.d 3) (= tptp.d 3))) :rule refl)
% 0.61/0.85  (step t400 (cl (= (not (not (= tptp.d 3))) (= tptp.d 3))) :rule all_simplify)
% 0.61/0.85  (step t401 (cl (= (= (= tptp.d 3) (not (not (= tptp.d 3)))) (= (= tptp.d 3) (= tptp.d 3)))) :rule cong :premises (t399 t400))
% 0.61/0.85  (step t402 (cl (= (= (= tptp.d 3) (= tptp.d 3)) true)) :rule all_simplify)
% 0.61/0.85  (step t403 (cl (= (= (= tptp.d 3) (not (not (= tptp.d 3)))) true)) :rule trans :premises (t401 t402))
% 0.61/0.85  (step t404 (cl (= (= (not (not (= tptp.d 3))) (= tptp.d 3)) true)) :rule trans :premises (t398 t403))
% 0.61/0.85  (step t405 (cl (= (not (not (= tptp.d 3))) (= tptp.d 3))) :rule resolution :premises (t397 t404))
% 0.61/0.85  (step t406 (cl (= (or (not (>= tptp.d 3)) (not (not (>= tptp.d 4))) (not (not (= tptp.d 3)))) (or (not (>= tptp.d 3)) (>= tptp.d 4) (= tptp.d 3)))) :rule cong :premises (t154 t344 t405))
% 0.61/0.85  (step t407 (cl (not (= (=> (and (>= tptp.d 3) (not (>= tptp.d 4)) (not (= tptp.d 3))) (and (not (= tptp.d 3)) (not (>= tptp.d 4)) (>= tptp.d 3))) (not (and (>= tptp.d 3) (not (>= tptp.d 4)) (not (= tptp.d 3)))))) (not (=> (and (>= tptp.d 3) (not (>= tptp.d 4)) (not (= tptp.d 3))) (and (not (= tptp.d 3)) (not (>= tptp.d 4)) (>= tptp.d 3)))) (not (and (>= tptp.d 3) (not (>= tptp.d 4)) (not (= tptp.d 3))))) :rule equiv_pos2)
% 0.61/0.85  (step t408 (cl (= (and (>= tptp.d 3) (not (>= tptp.d 4)) (not (= tptp.d 3))) (and (>= tptp.d 3) (not (>= tptp.d 4)) (not (= tptp.d 3))))) :rule refl)
% 0.61/0.85  (step t409 (cl (= (= (and (not (= tptp.d 3)) (not (>= tptp.d 4)) (>= tptp.d 3)) false) (not (and (not (= tptp.d 3)) (not (>= tptp.d 4)) (>= tptp.d 3))))) :rule equiv_simplify)
% 0.61/0.85  (step t410 (cl (= (and (not (= tptp.d 3)) (not (>= tptp.d 4)) (>= tptp.d 3)) false) (not (not (and (not (= tptp.d 3)) (not (>= tptp.d 4)) (>= tptp.d 3))))) :rule equiv2 :premises (t409))
% 0.61/0.85  (step t411 (cl (not (not (not (and (not (= tptp.d 3)) (not (>= tptp.d 4)) (>= tptp.d 3))))) (and (not (= tptp.d 3)) (not (>= tptp.d 4)) (>= tptp.d 3))) :rule not_not)
% 0.61/0.85  (step t412 (cl (= (and (not (= tptp.d 3)) (not (>= tptp.d 4)) (>= tptp.d 3)) false) (and (not (= tptp.d 3)) (not (>= tptp.d 4)) (>= tptp.d 3))) :rule resolution :premises (t410 t411))
% 0.61/0.85  (step t413 (cl (=> (and (not (= tptp.d 3)) (not (>= tptp.d 4)) (>= tptp.d 3)) false) (and (not (= tptp.d 3)) (not (>= tptp.d 4)) (>= tptp.d 3))) :rule implies_neg1)
% 0.61/0.85  (anchor :step t414)
% 0.61/0.85  (assume t414.a0 (not (= tptp.d 3)))
% 0.61/0.85  (assume t414.a1 (not (>= tptp.d 4)))
% 0.61/0.85  (assume t414.a2 (>= tptp.d 3))
% 0.61/0.85  (step t414.t1 (cl (or (= tptp.d 3) (not (<= tptp.d 3)) (not (<= 3 tptp.d)))) :rule la_disequality)
% 0.61/0.85  (step t414.t2 (cl (= tptp.d 3) (not (<= tptp.d 3)) (not (<= 3 tptp.d))) :rule or :premises (t414.t1))
% 0.61/0.85  (step t414.t3 (cl (not (= (>= tptp.d 3) (<= 3 tptp.d))) (not (>= tptp.d 3)) (<= 3 tptp.d)) :rule equiv_pos2)
% 0.61/0.85  (step t414.t4 (cl (= (>= tptp.d 3) (<= 3 tptp.d))) :rule comp_simplify)
% 0.61/0.85  (step t414.t5 (cl (<= 3 tptp.d)) :rule resolution :premises (t414.t3 t414.t4 t414.a2))
% 0.61/0.85  (step t414.t6 (cl (not (< tptp.d 4)) (<= tptp.d 3)) :rule la_generic :args (1 1))
% 0.61/0.85  (step t414.t7 (cl (not (= (not (>= tptp.d 4)) (< tptp.d 4))) (not (not (>= tptp.d 4))) (< tptp.d 4)) :rule equiv_pos2)
% 0.61/0.85  (step t414.t8 (cl (= (not (>= tptp.d 4)) (< tptp.d 4))) :rule symm :premises (t295))
% 0.61/0.85  (step t414.t9 (cl (< tptp.d 4)) :rule resolution :premises (t414.t7 t414.t8 t414.a1))
% 0.61/0.85  (step t414.t10 (cl (<= tptp.d 3)) :rule resolution :premises (t414.t6 t414.t9))
% 0.61/0.85  (step t414.t11 (cl (= tptp.d 3)) :rule resolution :premises (t414.t2 t414.t5 t414.t10))
% 0.61/0.85  (step t414.t12 (cl) :rule resolution :premises (t414.t11 t414.a0))
% 0.61/0.85  (step t414 (cl (not (not (= tptp.d 3))) (not (not (>= tptp.d 4))) (not (>= tptp.d 3)) false) :rule subproof :discharge (t414.a0 t414.a1 t414.a2))
% 0.61/0.85  (step t415 (cl (not (and (not (= tptp.d 3)) (not (>= tptp.d 4)) (>= tptp.d 3))) (not (= tptp.d 3))) :rule and_pos)
% 0.61/0.85  (step t416 (cl (not (and (not (= tptp.d 3)) (not (>= tptp.d 4)) (>= tptp.d 3))) (not (>= tptp.d 4))) :rule and_pos)
% 0.61/0.85  (step t417 (cl (not (and (not (= tptp.d 3)) (not (>= tptp.d 4)) (>= tptp.d 3))) (>= tptp.d 3)) :rule and_pos)
% 0.61/0.85  (step t418 (cl false (not (and (not (= tptp.d 3)) (not (>= tptp.d 4)) (>= tptp.d 3))) (not (and (not (= tptp.d 3)) (not (>= tptp.d 4)) (>= tptp.d 3))) (not (and (not (= tptp.d 3)) (not (>= tptp.d 4)) (>= tptp.d 3)))) :rule resolution :premises (t414 t415 t416 t417))
% 0.61/0.85  (step t419 (cl (not (and (not (= tptp.d 3)) (not (>= tptp.d 4)) (>= tptp.d 3))) (not (and (not (= tptp.d 3)) (not (>= tptp.d 4)) (>= tptp.d 3))) (not (and (not (= tptp.d 3)) (not (>= tptp.d 4)) (>= tptp.d 3))) false) :rule reordering :premises (t418))
% 0.61/0.85  (step t420 (cl (not (and (not (= tptp.d 3)) (not (>= tptp.d 4)) (>= tptp.d 3))) false) :rule contraction :premises (t419))
% 0.61/0.85  (step t421 (cl (=> (and (not (= tptp.d 3)) (not (>= tptp.d 4)) (>= tptp.d 3)) false) false) :rule resolution :premises (t413 t420))
% 0.61/0.85  (step t422 (cl (=> (and (not (= tptp.d 3)) (not (>= tptp.d 4)) (>= tptp.d 3)) false) (not false)) :rule implies_neg2)
% 0.61/0.85  (step t423 (cl (=> (and (not (= tptp.d 3)) (not (>= tptp.d 4)) (>= tptp.d 3)) false) (=> (and (not (= tptp.d 3)) (not (>= tptp.d 4)) (>= tptp.d 3)) false)) :rule resolution :premises (t421 t422))
% 0.61/0.85  (step t424 (cl (=> (and (not (= tptp.d 3)) (not (>= tptp.d 4)) (>= tptp.d 3)) false)) :rule contraction :premises (t423))
% 0.61/0.85  (step t425 (cl (= (=> (and (not (= tptp.d 3)) (not (>= tptp.d 4)) (>= tptp.d 3)) false) (not (and (not (= tptp.d 3)) (not (>= tptp.d 4)) (>= tptp.d 3))))) :rule implies_simplify)
% 0.61/0.85  (step t426 (cl (not (=> (and (not (= tptp.d 3)) (not (>= tptp.d 4)) (>= tptp.d 3)) false)) (not (and (not (= tptp.d 3)) (not (>= tptp.d 4)) (>= tptp.d 3)))) :rule equiv1 :premises (t425))
% 0.61/0.85  (step t427 (cl (not (and (not (= tptp.d 3)) (not (>= tptp.d 4)) (>= tptp.d 3)))) :rule resolution :premises (t424 t426))
% 0.61/0.85  (step t428 (cl (= (and (not (= tptp.d 3)) (not (>= tptp.d 4)) (>= tptp.d 3)) false)) :rule resolution :premises (t412 t427))
% 0.61/0.85  (step t429 (cl (= (=> (and (>= tptp.d 3) (not (>= tptp.d 4)) (not (= tptp.d 3))) (and (not (= tptp.d 3)) (not (>= tptp.d 4)) (>= tptp.d 3))) (=> (and (>= tptp.d 3) (not (>= tptp.d 4)) (not (= tptp.d 3))) false))) :rule cong :premises (t408 t428))
% 0.61/0.85  (step t430 (cl (= (=> (and (>= tptp.d 3) (not (>= tptp.d 4)) (not (= tptp.d 3))) false) (not (and (>= tptp.d 3) (not (>= tptp.d 4)) (not (= tptp.d 3)))))) :rule all_simplify)
% 0.61/0.85  (step t431 (cl (= (=> (and (>= tptp.d 3) (not (>= tptp.d 4)) (not (= tptp.d 3))) (and (not (= tptp.d 3)) (not (>= tptp.d 4)) (>= tptp.d 3))) (not (and (>= tptp.d 3) (not (>= tptp.d 4)) (not (= tptp.d 3)))))) :rule trans :premises (t429 t430))
% 0.61/0.85  (step t432 (cl (=> (and (>= tptp.d 3) (not (>= tptp.d 4)) (not (= tptp.d 3))) (and (not (= tptp.d 3)) (not (>= tptp.d 4)) (>= tptp.d 3))) (and (>= tptp.d 3) (not (>= tptp.d 4)) (not (= tptp.d 3)))) :rule implies_neg1)
% 0.61/0.85  (anchor :step t433)
% 0.61/0.85  (assume t433.a0 (>= tptp.d 3))
% 0.61/0.85  (assume t433.a1 (not (>= tptp.d 4)))
% 0.61/0.85  (assume t433.a2 (not (= tptp.d 3)))
% 0.61/0.85  (step t433.t1 (cl (and (not (= tptp.d 3)) (not (>= tptp.d 4)) (>= tptp.d 3)) (not (not (= tptp.d 3))) (not (not (>= tptp.d 4))) (not (>= tptp.d 3))) :rule and_neg)
% 0.61/0.85  (step t433.t2 (cl (and (not (= tptp.d 3)) (not (>= tptp.d 4)) (>= tptp.d 3))) :rule resolution :premises (t433.t1 t433.a2 t433.a1 t433.a0))
% 0.61/0.85  (step t433 (cl (not (>= tptp.d 3)) (not (not (>= tptp.d 4))) (not (not (= tptp.d 3))) (and (not (= tptp.d 3)) (not (>= tptp.d 4)) (>= tptp.d 3))) :rule subproof :discharge (t433.a0 t433.a1 t433.a2))
% 0.61/0.85  (step t434 (cl (not (and (>= tptp.d 3) (not (>= tptp.d 4)) (not (= tptp.d 3)))) (>= tptp.d 3)) :rule and_pos)
% 0.61/0.85  (step t435 (cl (not (and (>= tptp.d 3) (not (>= tptp.d 4)) (not (= tptp.d 3)))) (not (>= tptp.d 4))) :rule and_pos)
% 0.61/0.85  (step t436 (cl (not (and (>= tptp.d 3) (not (>= tptp.d 4)) (not (= tptp.d 3)))) (not (= tptp.d 3))) :rule and_pos)
% 0.61/0.85  (step t437 (cl (and (not (= tptp.d 3)) (not (>= tptp.d 4)) (>= tptp.d 3)) (not (and (>= tptp.d 3) (not (>= tptp.d 4)) (not (= tptp.d 3)))) (not (and (>= tptp.d 3) (not (>= tptp.d 4)) (not (= tptp.d 3)))) (not (and (>= tptp.d 3) (not (>= tptp.d 4)) (not (= tptp.d 3))))) :rule resolution :premises (t433 t434 t435 t436))
% 0.61/0.85  (step t438 (cl (not (and (>= tptp.d 3) (not (>= tptp.d 4)) (not (= tptp.d 3)))) (not (and (>= tptp.d 3) (not (>= tptp.d 4)) (not (= tptp.d 3)))) (not (and (>= tptp.d 3) (not (>= tptp.d 4)) (not (= tptp.d 3)))) (and (not (= tptp.d 3)) (not (>= tptp.d 4)) (>= tptp.d 3))) :rule reordering :premises (t437))
% 0.61/0.85  (step t439 (cl (not (and (>= tptp.d 3) (not (>= tptp.d 4)) (not (= tptp.d 3)))) (and (not (= tptp.d 3)) (not (>= tptp.d 4)) (>= tptp.d 3))) :rule contraction :premises (t438))
% 0.61/0.85  (step t440 (cl (=> (and (>= tptp.d 3) (not (>= tptp.d 4)) (not (= tptp.d 3))) (and (not (= tptp.d 3)) (not (>= tptp.d 4)) (>= tptp.d 3))) (and (not (= tptp.d 3)) (not (>= tptp.d 4)) (>= tptp.d 3))) :rule resolution :premises (t432 t439))
% 0.61/0.85  (step t441 (cl (=> (and (>= tptp.d 3) (not (>= tptp.d 4)) (not (= tptp.d 3))) (and (not (= tptp.d 3)) (not (>= tptp.d 4)) (>= tptp.d 3))) (not (and (not (= tptp.d 3)) (not (>= tptp.d 4)) (>= tptp.d 3)))) :rule implies_neg2)
% 0.61/0.85  (step t442 (cl (=> (and (>= tptp.d 3) (not (>= tptp.d 4)) (not (= tptp.d 3))) (and (not (= tptp.d 3)) (not (>= tptp.d 4)) (>= tptp.d 3))) (=> (and (>= tptp.d 3) (not (>= tptp.d 4)) (not (= tptp.d 3))) (and (not (= tptp.d 3)) (not (>= tptp.d 4)) (>= tptp.d 3)))) :rule resolution :premises (t440 t441))
% 0.61/0.85  (step t443 (cl (=> (and (>= tptp.d 3) (not (>= tptp.d 4)) (not (= tptp.d 3))) (and (not (= tptp.d 3)) (not (>= tptp.d 4)) (>= tptp.d 3)))) :rule contraction :premises (t442))
% 0.61/0.85  (step t444 (cl (not (and (>= tptp.d 3) (not (>= tptp.d 4)) (not (= tptp.d 3))))) :rule resolution :premises (t407 t431 t443))
% 0.61/0.85  (step t445 (cl (not (>= tptp.d 3)) (not (not (>= tptp.d 4))) (not (not (= tptp.d 3)))) :rule not_and :premises (t444))
% 0.61/0.85  (step t446 (cl (or (not (>= tptp.d 3)) (not (not (>= tptp.d 4))) (not (not (= tptp.d 3)))) (not (not (>= tptp.d 3)))) :rule or_neg)
% 0.61/0.85  (step t447 (cl (or (not (>= tptp.d 3)) (not (not (>= tptp.d 4))) (not (not (= tptp.d 3)))) (not (not (not (>= tptp.d 4))))) :rule or_neg)
% 0.61/0.85  (step t448 (cl (or (not (>= tptp.d 3)) (not (not (>= tptp.d 4))) (not (not (= tptp.d 3)))) (not (not (not (= tptp.d 3))))) :rule or_neg)
% 0.61/0.85  (step t449 (cl (or (not (>= tptp.d 3)) (not (not (>= tptp.d 4))) (not (not (= tptp.d 3)))) (or (not (>= tptp.d 3)) (not (not (>= tptp.d 4))) (not (not (= tptp.d 3)))) (or (not (>= tptp.d 3)) (not (not (>= tptp.d 4))) (not (not (= tptp.d 3))))) :rule resolution :premises (t445 t446 t447 t448))
% 0.61/0.85  (step t450 (cl (or (not (>= tptp.d 3)) (not (not (>= tptp.d 4))) (not (not (= tptp.d 3))))) :rule contraction :premises (t449))
% 0.61/0.85  (step t451 (cl (or (not (>= tptp.d 3)) (>= tptp.d 4) (= tptp.d 3))) :rule resolution :premises (t395 t406 t450))
% 0.61/0.85  (step t452 (cl (not (>= tptp.d 3)) (>= tptp.d 4) (= tptp.d 3)) :rule or :premises (t451))
% 0.61/0.85  (step t453 (cl (>= tptp.d 4) (>= tptp.d 4)) :rule resolution :premises (t392 t202 t394 t452 t198))
% 0.61/0.85  (step t454 (cl (>= tptp.d 4)) :rule contraction :premises (t453))
% 0.61/0.85  (step t455 (cl (not (= (=> (and (>= tptp.c 2) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.d 4) (= (* tptp.d tptp.c) (* 4 tptp.c))) (and (>= tptp.c 2) (= tptp.d 4) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 4 tptp.c)))) (not (and (>= tptp.c 2) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.d 4) (= (* tptp.d tptp.c) (* 4 tptp.c)))))) (not (=> (and (>= tptp.c 2) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.d 4) (= (* tptp.d tptp.c) (* 4 tptp.c))) (and (>= tptp.c 2) (= tptp.d 4) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 4 tptp.c))))) (not (and (>= tptp.c 2) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.d 4) (= (* tptp.d tptp.c) (* 4 tptp.c))))) :rule equiv_pos2)
% 0.61/0.85  (step t456 (cl (= (and (>= tptp.c 2) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.d 4) (= (* tptp.d tptp.c) (* 4 tptp.c))) (and (>= tptp.c 2) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.d 4) (= (* tptp.d tptp.c) (* 4 tptp.c))))) :rule refl)
% 0.61/0.85  (step t457 (cl (= (= (and (>= tptp.c 2) (= tptp.d 4) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 4 tptp.c))) false) (not (and (>= tptp.c 2) (= tptp.d 4) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 4 tptp.c)))))) :rule equiv_simplify)
% 0.61/0.85  (step t458 (cl (= (and (>= tptp.c 2) (= tptp.d 4) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 4 tptp.c))) false) (not (not (and (>= tptp.c 2) (= tptp.d 4) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 4 tptp.c)))))) :rule equiv2 :premises (t457))
% 0.61/0.85  (step t459 (cl (not (not (not (and (>= tptp.c 2) (= tptp.d 4) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 4 tptp.c)))))) (and (>= tptp.c 2) (= tptp.d 4) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 4 tptp.c)))) :rule not_not)
% 0.61/0.85  (step t460 (cl (= (and (>= tptp.c 2) (= tptp.d 4) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 4 tptp.c))) false) (and (>= tptp.c 2) (= tptp.d 4) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 4 tptp.c)))) :rule resolution :premises (t458 t459))
% 0.61/0.85  (step t461 (cl (=> (and (>= tptp.c 2) (= tptp.d 4) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 4 tptp.c))) false) (and (>= tptp.c 2) (= tptp.d 4) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 4 tptp.c)))) :rule implies_neg1)
% 0.61/0.85  (anchor :step t462)
% 0.61/0.85  (assume t462.a0 (>= tptp.c 2))
% 0.61/0.85  (assume t462.a1 (= tptp.d 4))
% 0.61/0.85  (assume t462.a2 (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))
% 0.61/0.85  (assume t462.a3 (= (* tptp.d tptp.c) (* 4 tptp.c)))
% 0.61/0.85  (step t462.t1 (cl (not (= (= (* tptp.d tptp.c) (* 4 tptp.c)) (= (+ (* 4 tptp.c) (* (- 1) (* tptp.d tptp.c))) 0))) (not (= (* tptp.d tptp.c) (* 4 tptp.c))) (= (+ (* 4 tptp.c) (* (- 1) (* tptp.d tptp.c))) 0)) :rule equiv_pos2)
% 0.61/0.85  (step t462.t2 (cl (= (= (+ (* 4 tptp.c) (* (- 1) (* tptp.d tptp.c))) 0) (= (* tptp.d tptp.c) (* 4 tptp.c)))) :rule all_simplify)
% 0.61/0.85  (step t462.t3 (cl (= (= (* tptp.d tptp.c) (* 4 tptp.c)) (= (+ (* 4 tptp.c) (* (- 1) (* tptp.d tptp.c))) 0))) :rule symm :premises (t462.t2))
% 0.61/0.85  (step t462.t4 (cl (= (+ (* 4 tptp.c) (* (- 1) (* tptp.d tptp.c))) 0)) :rule resolution :premises (t462.t1 t462.t3 t462.a3))
% 0.61/0.85  (step t462.t5 (cl (=> (= (+ (* 4 tptp.c) (* (- 1) (* tptp.d tptp.c))) 0) false) (= (+ (* 4 tptp.c) (* (- 1) (* tptp.d tptp.c))) 0)) :rule implies_neg1)
% 0.61/0.85  (anchor :step t462.t6)
% 0.61/0.85  (assume t462.t6.a0 (= (+ (* 4 tptp.c) (* (- 1) (* tptp.d tptp.c))) 0))
% 0.61/0.85  (step t462.t6.t1 (cl (not (= (<= (+ (* 1.0 (+ (* 4 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 2.0 tptp.d) (* (- 1.0) tptp.c)) (+ (* 1.0 0) (* (- 1.0) 7) (* 2.0 4) (* (- 1.0) 2))) false)) (not (<= (+ (* 1.0 (+ (* 4 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 2.0 tptp.d) (* (- 1.0) tptp.c)) (+ (* 1.0 0) (* (- 1.0) 7) (* 2.0 4) (* (- 1.0) 2)))) false) :rule equiv_pos2)
% 0.61/0.85  (step t462.t6.t2 (cl (= (* 1.0 (+ (* 4 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (to_real (+ (* 4 tptp.c) (* (- 1) (* tptp.d tptp.c)))))) :rule all_simplify)
% 0.61/0.85  (step t462.t6.t3 (cl (= (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (to_real (+ (* (- 2) tptp.d) (* (- 3) tptp.c) (* tptp.d tptp.c))))) :rule all_simplify)
% 0.61/0.85  (step t462.t6.t4 (cl (= (* 2.0 tptp.d) (to_real (* 2 tptp.d)))) :rule all_simplify)
% 0.61/0.85  (step t462.t6.t5 (cl (= (* (- 1.0) tptp.c) (to_real (* (- 1) tptp.c)))) :rule all_simplify)
% 0.61/0.85  (step t462.t6.t6 (cl (= (+ (* 1.0 (+ (* 4 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 2.0 tptp.d) (* (- 1.0) tptp.c)) (+ (to_real (+ (* 4 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (to_real (+ (* (- 2) tptp.d) (* (- 3) tptp.c) (* tptp.d tptp.c))) (to_real (* 2 tptp.d)) (to_real (* (- 1) tptp.c))))) :rule cong :premises (t462.t6.t2 t462.t6.t3 t462.t6.t4 t462.t6.t5))
% 0.61/0.85  (step t462.t6.t7 (cl (= (+ (to_real (+ (* 4 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (to_real (+ (* (- 2) tptp.d) (* (- 3) tptp.c) (* tptp.d tptp.c))) (to_real (* 2 tptp.d)) (to_real (* (- 1) tptp.c))) 0.0)) :rule all_simplify)
% 0.61/0.85  (step t462.t6.t8 (cl (= (+ (* 1.0 (+ (* 4 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 2.0 tptp.d) (* (- 1.0) tptp.c)) 0.0)) :rule trans :premises (t462.t6.t6 t462.t6.t7))
% 0.61/0.85  (step t462.t6.t9 (cl (= (* 1.0 0) 0.0)) :rule all_simplify)
% 0.61/0.85  (step t462.t6.t10 (cl (= (* (- 1.0) 7) (- 7.0))) :rule all_simplify)
% 0.61/0.85  (step t462.t6.t11 (cl (= (* 2.0 4) 8.0)) :rule all_simplify)
% 0.61/0.85  (step t462.t6.t12 (cl (= (* (- 1.0) 2) (- 2.0))) :rule all_simplify)
% 0.61/0.85  (step t462.t6.t13 (cl (= (+ (* 1.0 0) (* (- 1.0) 7) (* 2.0 4) (* (- 1.0) 2)) (+ 0.0 (- 7.0) 8.0 (- 2.0)))) :rule cong :premises (t462.t6.t9 t462.t6.t10 t462.t6.t11 t462.t6.t12))
% 0.61/0.85  (step t462.t6.t14 (cl (= (+ 0.0 (- 7.0) 8.0 (- 2.0)) (- 1.0))) :rule all_simplify)
% 0.61/0.85  (step t462.t6.t15 (cl (= (+ (* 1.0 0) (* (- 1.0) 7) (* 2.0 4) (* (- 1.0) 2)) (- 1.0))) :rule trans :premises (t462.t6.t13 t462.t6.t14))
% 0.61/0.85  (step t462.t6.t16 (cl (= (<= (+ (* 1.0 (+ (* 4 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 2.0 tptp.d) (* (- 1.0) tptp.c)) (+ (* 1.0 0) (* (- 1.0) 7) (* 2.0 4) (* (- 1.0) 2))) (<= 0.0 (- 1.0)))) :rule cong :premises (t462.t6.t8 t462.t6.t15))
% 0.61/0.85  (step t462.t6.t17 (cl (= (<= 0.0 (- 1.0)) false)) :rule all_simplify)
% 0.61/0.85  (step t462.t6.t18 (cl (= (<= (+ (* 1.0 (+ (* 4 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 2.0 tptp.d) (* (- 1.0) tptp.c)) (+ (* 1.0 0) (* (- 1.0) 7) (* 2.0 4) (* (- 1.0) 2))) false)) :rule trans :premises (t462.t6.t16 t462.t6.t17))
% 0.61/0.85  (step t462.t6.t19 (cl (not (= (* 1.0 (+ (* 4 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 1.0 0))) (not (<= (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) 7))) (not (= (* 2.0 tptp.d) (* 2.0 4))) (not (<= (* (- 1.0) tptp.c) (* (- 1.0) 2))) (<= (+ (* 1.0 (+ (* 4 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 2.0 tptp.d) (* (- 1.0) tptp.c)) (+ (* 1.0 0) (* (- 1.0) 7) (* 2.0 4) (* (- 1.0) 2)))) :rule la_generic :args ((- 1) 1 (- 1) 1 1))
% 0.61/0.85  (step t462.t6.t20 (cl (=> (and (> 1.0 0) (= (+ (* 4 tptp.c) (* (- 1) (* tptp.d tptp.c))) 0)) (= (* 1.0 (+ (* 4 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 1.0 0)))) :rule la_mult_pos)
% 0.61/0.85  (step t462.t6.t21 (cl (not (and (> 1.0 0) (= (+ (* 4 tptp.c) (* (- 1) (* tptp.d tptp.c))) 0))) (= (* 1.0 (+ (* 4 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 1.0 0))) :rule implies :premises (t462.t6.t20))
% 0.61/0.85  (step t462.t6.t22 (cl (and (> 1.0 0) (= (+ (* 4 tptp.c) (* (- 1) (* tptp.d tptp.c))) 0)) (not (> 1.0 0)) (not (= (+ (* 4 tptp.c) (* (- 1) (* tptp.d tptp.c))) 0))) :rule and_neg)
% 0.61/0.85  (step t462.t6.t23 (cl (= (= (> 1.0 0) true) (> 1.0 0))) :rule equiv_simplify)
% 0.61/0.85  (step t462.t6.t24 (cl (not (= (> 1.0 0) true)) (> 1.0 0)) :rule equiv1 :premises (t462.t6.t23))
% 0.61/0.85  (step t462.t6.t25 (cl (= (> 1.0 0) true)) :rule hole :args ((> 1.0 0)))
% 0.61/0.85  (step t462.t6.t26 (cl (> 1.0 0)) :rule resolution :premises (t462.t6.t24 t462.t6.t25))
% 0.61/0.85  (step t462.t6.t27 (cl (and (> 1.0 0) (= (+ (* 4 tptp.c) (* (- 1) (* tptp.d tptp.c))) 0))) :rule resolution :premises (t462.t6.t22 t462.t6.t26 t462.t6.a0))
% 0.61/0.85  (step t462.t6.t28 (cl (= (* 1.0 (+ (* 4 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 1.0 0))) :rule resolution :premises (t462.t6.t21 t462.t6.t27))
% 0.61/0.85  (step t462.t6.t29 (cl (=> (and (< (- 1.0) 0) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (<= (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) 7)))) :rule la_mult_neg)
% 0.61/0.85  (step t462.t6.t30 (cl (not (and (< (- 1.0) 0) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (<= (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) 7))) :rule implies :premises (t462.t6.t29))
% 0.61/0.85  (step t462.t6.t31 (cl (and (< (- 1.0) 0) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (< (- 1.0) 0)) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule and_neg)
% 0.61/0.85  (step t462.t6.t32 (cl (= (= (< (- 1.0) 0) true) (< (- 1.0) 0))) :rule equiv_simplify)
% 0.61/0.85  (step t462.t6.t33 (cl (not (= (< (- 1.0) 0) true)) (< (- 1.0) 0)) :rule equiv1 :premises (t462.t6.t32))
% 0.61/0.85  (step t462.t6.t34 (cl (= (< (- 1.0) 0) true)) :rule hole :args ((< (- 1.0) 0)))
% 0.61/0.85  (step t462.t6.t35 (cl (< (- 1.0) 0)) :rule resolution :premises (t462.t6.t33 t462.t6.t34))
% 0.61/0.85  (step t462.t6.t36 (cl (and (< (- 1.0) 0) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule resolution :premises (t462.t6.t31 t462.t6.t35 t462.a2))
% 0.61/0.85  (step t462.t6.t37 (cl (<= (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) 7))) :rule resolution :premises (t462.t6.t30 t462.t6.t36))
% 0.61/0.85  (step t462.t6.t38 (cl (=> (and (> 2.0 0) (= tptp.d 4)) (= (* 2.0 tptp.d) (* 2.0 4)))) :rule la_mult_pos)
% 0.61/0.85  (step t462.t6.t39 (cl (not (and (> 2.0 0) (= tptp.d 4))) (= (* 2.0 tptp.d) (* 2.0 4))) :rule implies :premises (t462.t6.t38))
% 0.61/0.85  (step t462.t6.t40 (cl (and (> 2.0 0) (= tptp.d 4)) (not (> 2.0 0)) (not (= tptp.d 4))) :rule and_neg)
% 0.61/0.85  (step t462.t6.t41 (cl (= (= (> 2.0 0) true) (> 2.0 0))) :rule equiv_simplify)
% 0.61/0.85  (step t462.t6.t42 (cl (not (= (> 2.0 0) true)) (> 2.0 0)) :rule equiv1 :premises (t462.t6.t41))
% 0.61/0.85  (step t462.t6.t43 (cl (= (> 2.0 0) true)) :rule hole :args ((> 2.0 0)))
% 0.61/0.85  (step t462.t6.t44 (cl (> 2.0 0)) :rule resolution :premises (t462.t6.t42 t462.t6.t43))
% 0.61/0.85  (step t462.t6.t45 (cl (and (> 2.0 0) (= tptp.d 4))) :rule resolution :premises (t462.t6.t40 t462.t6.t44 t462.a1))
% 0.61/0.85  (step t462.t6.t46 (cl (= (* 2.0 tptp.d) (* 2.0 4))) :rule resolution :premises (t462.t6.t39 t462.t6.t45))
% 0.61/0.85  (step t462.t6.t47 (cl (=> (and (< (- 1.0) 0) (>= tptp.c 2)) (<= (* (- 1.0) tptp.c) (* (- 1.0) 2)))) :rule la_mult_neg)
% 0.61/0.85  (step t462.t6.t48 (cl (not (and (< (- 1.0) 0) (>= tptp.c 2))) (<= (* (- 1.0) tptp.c) (* (- 1.0) 2))) :rule implies :premises (t462.t6.t47))
% 0.61/0.85  (step t462.t6.t49 (cl (and (< (- 1.0) 0) (>= tptp.c 2)) (not (< (- 1.0) 0)) (not (>= tptp.c 2))) :rule and_neg)
% 0.61/0.85  (step t462.t6.t50 (cl (and (< (- 1.0) 0) (>= tptp.c 2))) :rule resolution :premises (t462.t6.t49 t462.t6.t35 t462.a0))
% 0.61/0.85  (step t462.t6.t51 (cl (<= (* (- 1.0) tptp.c) (* (- 1.0) 2))) :rule resolution :premises (t462.t6.t48 t462.t6.t50))
% 0.61/0.85  (step t462.t6.t52 (cl (<= (+ (* 1.0 (+ (* 4 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 2.0 tptp.d) (* (- 1.0) tptp.c)) (+ (* 1.0 0) (* (- 1.0) 7) (* 2.0 4) (* (- 1.0) 2)))) :rule resolution :premises (t462.t6.t19 t462.t6.t28 t462.t6.t37 t462.t6.t46 t462.t6.t51))
% 0.61/0.85  (step t462.t6.t53 (cl false) :rule resolution :premises (t462.t6.t1 t462.t6.t18 t462.t6.t52))
% 0.61/0.85  (step t462.t6 (cl (not (= (+ (* 4 tptp.c) (* (- 1) (* tptp.d tptp.c))) 0)) false) :rule subproof :discharge (t462.t6.a0))
% 0.61/0.85  (step t462.t7 (cl (=> (= (+ (* 4 tptp.c) (* (- 1) (* tptp.d tptp.c))) 0) false) false) :rule resolution :premises (t462.t5 t462.t6))
% 0.61/0.85  (step t462.t8 (cl (=> (= (+ (* 4 tptp.c) (* (- 1) (* tptp.d tptp.c))) 0) false) (not false)) :rule implies_neg2)
% 0.61/0.85  (step t462.t9 (cl (=> (= (+ (* 4 tptp.c) (* (- 1) (* tptp.d tptp.c))) 0) false) (=> (= (+ (* 4 tptp.c) (* (- 1) (* tptp.d tptp.c))) 0) false)) :rule resolution :premises (t462.t7 t462.t8))
% 0.61/0.85  (step t462.t10 (cl (=> (= (+ (* 4 tptp.c) (* (- 1) (* tptp.d tptp.c))) 0) false)) :rule contraction :premises (t462.t9))
% 0.61/0.85  (step t462.t11 (cl (= (=> (= (+ (* 4 tptp.c) (* (- 1) (* tptp.d tptp.c))) 0) false) (not (= (+ (* 4 tptp.c) (* (- 1) (* tptp.d tptp.c))) 0)))) :rule implies_simplify)
% 0.61/0.85  (step t462.t12 (cl (not (=> (= (+ (* 4 tptp.c) (* (- 1) (* tptp.d tptp.c))) 0) false)) (not (= (+ (* 4 tptp.c) (* (- 1) (* tptp.d tptp.c))) 0))) :rule equiv1 :premises (t462.t11))
% 0.61/0.85  (step t462.t13 (cl (not (= (+ (* 4 tptp.c) (* (- 1) (* tptp.d tptp.c))) 0))) :rule resolution :premises (t462.t10 t462.t12))
% 0.61/0.85  (step t462.t14 (cl) :rule resolution :premises (t462.t4 t462.t13))
% 0.61/0.85  (step t462 (cl (not (>= tptp.c 2)) (not (= tptp.d 4)) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (= (* tptp.d tptp.c) (* 4 tptp.c))) false) :rule subproof :discharge (t462.a0 t462.a1 t462.a2 t462.a3))
% 0.61/0.85  (step t463 (cl (not (and (>= tptp.c 2) (= tptp.d 4) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 4 tptp.c)))) (>= tptp.c 2)) :rule and_pos)
% 0.61/0.85  (step t464 (cl (not (and (>= tptp.c 2) (= tptp.d 4) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 4 tptp.c)))) (= tptp.d 4)) :rule and_pos)
% 0.61/0.85  (step t465 (cl (not (and (>= tptp.c 2) (= tptp.d 4) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 4 tptp.c)))) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) :rule and_pos)
% 0.61/0.85  (step t466 (cl (not (and (>= tptp.c 2) (= tptp.d 4) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 4 tptp.c)))) (= (* tptp.d tptp.c) (* 4 tptp.c))) :rule and_pos)
% 0.61/0.85  (step t467 (cl false (not (and (>= tptp.c 2) (= tptp.d 4) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 4 tptp.c)))) (not (and (>= tptp.c 2) (= tptp.d 4) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 4 tptp.c)))) (not (and (>= tptp.c 2) (= tptp.d 4) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 4 tptp.c)))) (not (and (>= tptp.c 2) (= tptp.d 4) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 4 tptp.c))))) :rule resolution :premises (t462 t463 t464 t465 t466))
% 0.61/0.85  (step t468 (cl (not (and (>= tptp.c 2) (= tptp.d 4) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 4 tptp.c)))) (not (and (>= tptp.c 2) (= tptp.d 4) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 4 tptp.c)))) (not (and (>= tptp.c 2) (= tptp.d 4) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 4 tptp.c)))) (not (and (>= tptp.c 2) (= tptp.d 4) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 4 tptp.c)))) false) :rule reordering :premises (t467))
% 0.61/0.85  (step t469 (cl (not (and (>= tptp.c 2) (= tptp.d 4) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 4 tptp.c)))) false) :rule contraction :premises (t468))
% 0.61/0.85  (step t470 (cl (=> (and (>= tptp.c 2) (= tptp.d 4) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 4 tptp.c))) false) false) :rule resolution :premises (t461 t469))
% 0.61/0.85  (step t471 (cl (=> (and (>= tptp.c 2) (= tptp.d 4) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 4 tptp.c))) false) (not false)) :rule implies_neg2)
% 0.61/0.85  (step t472 (cl (=> (and (>= tptp.c 2) (= tptp.d 4) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 4 tptp.c))) false) (=> (and (>= tptp.c 2) (= tptp.d 4) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 4 tptp.c))) false)) :rule resolution :premises (t470 t471))
% 0.61/0.85  (step t473 (cl (=> (and (>= tptp.c 2) (= tptp.d 4) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 4 tptp.c))) false)) :rule contraction :premises (t472))
% 0.61/0.85  (step t474 (cl (= (=> (and (>= tptp.c 2) (= tptp.d 4) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 4 tptp.c))) false) (not (and (>= tptp.c 2) (= tptp.d 4) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 4 tptp.c)))))) :rule implies_simplify)
% 0.61/0.85  (step t475 (cl (not (=> (and (>= tptp.c 2) (= tptp.d 4) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 4 tptp.c))) false)) (not (and (>= tptp.c 2) (= tptp.d 4) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 4 tptp.c))))) :rule equiv1 :premises (t474))
% 0.61/0.85  (step t476 (cl (not (and (>= tptp.c 2) (= tptp.d 4) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 4 tptp.c))))) :rule resolution :premises (t473 t475))
% 0.61/0.85  (step t477 (cl (= (and (>= tptp.c 2) (= tptp.d 4) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 4 tptp.c))) false)) :rule resolution :premises (t460 t476))
% 0.61/0.85  (step t478 (cl (= (=> (and (>= tptp.c 2) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.d 4) (= (* tptp.d tptp.c) (* 4 tptp.c))) (and (>= tptp.c 2) (= tptp.d 4) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 4 tptp.c)))) (=> (and (>= tptp.c 2) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.d 4) (= (* tptp.d tptp.c) (* 4 tptp.c))) false))) :rule cong :premises (t456 t477))
% 0.61/0.85  (step t479 (cl (= (=> (and (>= tptp.c 2) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.d 4) (= (* tptp.d tptp.c) (* 4 tptp.c))) false) (not (and (>= tptp.c 2) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.d 4) (= (* tptp.d tptp.c) (* 4 tptp.c)))))) :rule all_simplify)
% 0.61/0.85  (step t480 (cl (= (=> (and (>= tptp.c 2) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.d 4) (= (* tptp.d tptp.c) (* 4 tptp.c))) (and (>= tptp.c 2) (= tptp.d 4) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 4 tptp.c)))) (not (and (>= tptp.c 2) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.d 4) (= (* tptp.d tptp.c) (* 4 tptp.c)))))) :rule trans :premises (t478 t479))
% 0.61/0.85  (step t481 (cl (=> (and (>= tptp.c 2) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.d 4) (= (* tptp.d tptp.c) (* 4 tptp.c))) (and (>= tptp.c 2) (= tptp.d 4) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 4 tptp.c)))) (and (>= tptp.c 2) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.d 4) (= (* tptp.d tptp.c) (* 4 tptp.c)))) :rule implies_neg1)
% 0.61/0.85  (anchor :step t482)
% 0.61/0.85  (assume t482.a0 (>= tptp.c 2))
% 0.61/0.85  (assume t482.a1 (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))
% 0.61/0.85  (assume t482.a2 (= tptp.d 4))
% 0.61/0.85  (assume t482.a3 (= (* tptp.d tptp.c) (* 4 tptp.c)))
% 0.61/0.85  (step t482.t1 (cl (and (>= tptp.c 2) (= tptp.d 4) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 4 tptp.c))) (not (>= tptp.c 2)) (not (= tptp.d 4)) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (= (* tptp.d tptp.c) (* 4 tptp.c)))) :rule and_neg)
% 0.61/0.85  (step t482.t2 (cl (and (>= tptp.c 2) (= tptp.d 4) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 4 tptp.c)))) :rule resolution :premises (t482.t1 t482.a0 t482.a2 t482.a1 t482.a3))
% 0.61/0.85  (step t482 (cl (not (>= tptp.c 2)) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (= tptp.d 4)) (not (= (* tptp.d tptp.c) (* 4 tptp.c))) (and (>= tptp.c 2) (= tptp.d 4) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 4 tptp.c)))) :rule subproof :discharge (t482.a0 t482.a1 t482.a2 t482.a3))
% 0.61/0.85  (step t483 (cl (not (and (>= tptp.c 2) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.d 4) (= (* tptp.d tptp.c) (* 4 tptp.c)))) (>= tptp.c 2)) :rule and_pos)
% 0.61/0.85  (step t484 (cl (not (and (>= tptp.c 2) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.d 4) (= (* tptp.d tptp.c) (* 4 tptp.c)))) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) :rule and_pos)
% 0.61/0.85  (step t485 (cl (not (and (>= tptp.c 2) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.d 4) (= (* tptp.d tptp.c) (* 4 tptp.c)))) (= tptp.d 4)) :rule and_pos)
% 0.61/0.85  (step t486 (cl (not (and (>= tptp.c 2) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.d 4) (= (* tptp.d tptp.c) (* 4 tptp.c)))) (= (* tptp.d tptp.c) (* 4 tptp.c))) :rule and_pos)
% 0.61/0.85  (step t487 (cl (and (>= tptp.c 2) (= tptp.d 4) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 4 tptp.c))) (not (and (>= tptp.c 2) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.d 4) (= (* tptp.d tptp.c) (* 4 tptp.c)))) (not (and (>= tptp.c 2) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.d 4) (= (* tptp.d tptp.c) (* 4 tptp.c)))) (not (and (>= tptp.c 2) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.d 4) (= (* tptp.d tptp.c) (* 4 tptp.c)))) (not (and (>= tptp.c 2) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.d 4) (= (* tptp.d tptp.c) (* 4 tptp.c))))) :rule resolution :premises (t482 t483 t484 t485 t486))
% 0.61/0.85  (step t488 (cl (not (and (>= tptp.c 2) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.d 4) (= (* tptp.d tptp.c) (* 4 tptp.c)))) (not (and (>= tptp.c 2) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.d 4) (= (* tptp.d tptp.c) (* 4 tptp.c)))) (not (and (>= tptp.c 2) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.d 4) (= (* tptp.d tptp.c) (* 4 tptp.c)))) (not (and (>= tptp.c 2) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.d 4) (= (* tptp.d tptp.c) (* 4 tptp.c)))) (and (>= tptp.c 2) (= tptp.d 4) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 4 tptp.c)))) :rule reordering :premises (t487))
% 0.61/0.85  (step t489 (cl (not (and (>= tptp.c 2) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.d 4) (= (* tptp.d tptp.c) (* 4 tptp.c)))) (and (>= tptp.c 2) (= tptp.d 4) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 4 tptp.c)))) :rule contraction :premises (t488))
% 0.61/0.85  (step t490 (cl (=> (and (>= tptp.c 2) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.d 4) (= (* tptp.d tptp.c) (* 4 tptp.c))) (and (>= tptp.c 2) (= tptp.d 4) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 4 tptp.c)))) (and (>= tptp.c 2) (= tptp.d 4) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 4 tptp.c)))) :rule resolution :premises (t481 t489))
% 0.61/0.85  (step t491 (cl (=> (and (>= tptp.c 2) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.d 4) (= (* tptp.d tptp.c) (* 4 tptp.c))) (and (>= tptp.c 2) (= tptp.d 4) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 4 tptp.c)))) (not (and (>= tptp.c 2) (= tptp.d 4) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 4 tptp.c))))) :rule implies_neg2)
% 0.61/0.85  (step t492 (cl (=> (and (>= tptp.c 2) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.d 4) (= (* tptp.d tptp.c) (* 4 tptp.c))) (and (>= tptp.c 2) (= tptp.d 4) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 4 tptp.c)))) (=> (and (>= tptp.c 2) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.d 4) (= (* tptp.d tptp.c) (* 4 tptp.c))) (and (>= tptp.c 2) (= tptp.d 4) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 4 tptp.c))))) :rule resolution :premises (t490 t491))
% 0.61/0.85  (step t493 (cl (=> (and (>= tptp.c 2) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.d 4) (= (* tptp.d tptp.c) (* 4 tptp.c))) (and (>= tptp.c 2) (= tptp.d 4) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= (* tptp.d tptp.c) (* 4 tptp.c))))) :rule contraction :premises (t492))
% 0.61/0.85  (step t494 (cl (not (and (>= tptp.c 2) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (= tptp.d 4) (= (* tptp.d tptp.c) (* 4 tptp.c))))) :rule resolution :premises (t455 t480 t493))
% 0.61/0.85  (step t495 (cl (not (>= tptp.c 2)) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (= tptp.d 4)) (not (= (* tptp.d tptp.c) (* 4 tptp.c)))) :rule not_and :premises (t494))
% 0.61/0.85  (step t496 (cl (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (>= tptp.c 2)) (not (= tptp.d 4)) (not (= (* tptp.d tptp.c) (* 4 tptp.c)))) :rule reordering :premises (t495))
% 0.61/0.85  (step t497 (cl (or (not (= tptp.d 4)) (= (* tptp.d tptp.c) (* 4 tptp.c)))) :rule hole :args ((or (not (= tptp.d 4)) (= (* tptp.d tptp.c) (* 4 tptp.c))) 3))
% 0.61/0.85  (step t498 (cl (not (= tptp.d 4)) (= (* tptp.d tptp.c) (* 4 tptp.c))) :rule or :premises (t497))
% 0.61/0.85  (step t499 (cl (not (= tptp.d 4)) (not (= tptp.d 4))) :rule resolution :premises (t496 t202 t195 t498))
% 0.61/0.85  (step t500 (cl (not (= tptp.d 4))) :rule contraction :premises (t499))
% 0.61/0.85  (step t501 (cl (>= tptp.d 5)) :rule resolution :premises (t333 t454 t500))
% 0.61/0.85  (step t502 (cl (>= tptp.d 1)) :rule resolution :premises (t289 t501))
% 0.61/0.85  (step t503 (cl (and (>= tptp.d 1) (>= tptp.c 2))) :rule resolution :premises (t234 t195 t502))
% 0.61/0.85  (step t504 (cl (not (>= (+ (* 2 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) :rule resolution :premises (t232 t503))
% 0.61/0.85  (step t505 (cl (not (= tptp.c 2))) :rule resolution :premises (t104 t202 t504))
% 0.61/0.85  (step t506 (cl (not (= (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (>= tptp.c 1)) (not (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)))) (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (>= tptp.c 1)) (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1) (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)))) (not (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (>= tptp.c 1)) (not (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0))))) (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (>= tptp.c 1)) (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1) (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0))) :rule equiv_pos2)
% 0.61/0.85  (step t507 (cl (= (not (>= tptp.c 1)) (not (>= tptp.c 1)))) :rule refl)
% 0.61/0.85  (step t508 (cl (= (= (= (not (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) true) (= (not (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)))) :rule equiv_simplify)
% 0.61/0.85  (step t509 (cl (not (= (= (not (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) true)) (= (not (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) :rule equiv1 :premises (t508))
% 0.61/0.85  (step t510 (cl (= (= (not (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (= (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1) (not (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)))))) :rule all_simplify)
% 0.61/0.85  (step t511 (cl (= (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1) (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) :rule refl)
% 0.61/0.85  (step t512 (cl (= (not (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) :rule all_simplify)
% 0.61/0.85  (step t513 (cl (= (= (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1) (not (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)))) (= (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1) (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)))) :rule cong :premises (t511 t512))
% 0.61/0.85  (step t514 (cl (= (= (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1) (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) true)) :rule all_simplify)
% 0.61/0.85  (step t515 (cl (= (= (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1) (not (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)))) true)) :rule trans :premises (t513 t514))
% 0.61/0.85  (step t516 (cl (= (= (not (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) true)) :rule trans :premises (t510 t515))
% 0.61/0.85  (step t517 (cl (= (not (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) :rule resolution :premises (t509 t516))
% 0.61/0.85  (step t518 (cl (= (= (= (not (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0))) (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)) true) (= (not (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0))) (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)))) :rule equiv_simplify)
% 0.61/0.85  (step t519 (cl (not (= (= (not (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0))) (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)) true)) (= (not (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0))) (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0))) :rule equiv1 :premises (t518))
% 0.61/0.85  (step t520 (cl (= (= (not (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0))) (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)) (= (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0) (not (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)))))) :rule all_simplify)
% 0.61/0.85  (step t521 (cl (= (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0) (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0))) :rule refl)
% 0.61/0.85  (step t522 (cl (= (not (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0))) (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0))) :rule all_simplify)
% 0.61/0.85  (step t523 (cl (= (= (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0) (not (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)))) (= (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0) (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)))) :rule cong :premises (t521 t522))
% 0.61/0.85  (step t524 (cl (= (= (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0) (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)) true)) :rule all_simplify)
% 0.61/0.85  (step t525 (cl (= (= (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0) (not (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)))) true)) :rule trans :premises (t523 t524))
% 0.61/0.85  (step t526 (cl (= (= (not (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0))) (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)) true)) :rule trans :premises (t520 t525))
% 0.61/0.85  (step t527 (cl (= (not (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0))) (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0))) :rule resolution :premises (t519 t526))
% 0.61/0.85  (step t528 (cl (= (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (>= tptp.c 1)) (not (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)))) (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (>= tptp.c 1)) (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1) (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)))) :rule cong :premises (t46 t507 t517 t527))
% 0.61/0.85  (step t529 (cl (not (= (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0))) (and (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)))))) (not (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0))) (and (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0))))) :rule equiv_pos2)
% 0.61/0.85  (step t530 (cl (= (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0))) (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0))))) :rule refl)
% 0.61/0.85  (step t531 (cl (= (= (and (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) false) (not (and (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))))) :rule equiv_simplify)
% 0.61/0.85  (step t532 (cl (= (and (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) false) (not (not (and (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))))) :rule equiv2 :premises (t531))
% 0.61/0.85  (step t533 (cl (not (not (not (and (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))))) (and (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule not_not)
% 0.61/0.85  (step t534 (cl (= (and (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) false) (and (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule resolution :premises (t532 t533))
% 0.61/0.85  (step t535 (cl (=> (and (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) false) (and (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule implies_neg1)
% 0.61/0.85  (anchor :step t536)
% 0.61/0.85  (assume t536.a0 (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)))
% 0.61/0.85  (assume t536.a1 (>= tptp.c 1))
% 0.61/0.85  (assume t536.a2 (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)))
% 0.61/0.85  (assume t536.a3 (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))
% 0.61/0.85  (step t536.t1 (cl (not (= (< (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)))) (not (< (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule equiv_pos2)
% 0.61/0.85  (step t536.t2 (cl (= (< (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)))) :rule all_simplify)
% 0.61/0.85  (step t536.t3 (cl (not (= (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (< (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (not (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (< (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) :rule equiv_pos2)
% 0.61/0.85  (step t536.t4 (cl (= (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (< (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule symm :premises (t536.t2))
% 0.61/0.85  (step t536.t5 (cl (=> (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) false) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) :rule implies_neg1)
% 0.61/0.85  (anchor :step t536.t6)
% 0.61/0.85  (assume t536.t6.a0 (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))
% 0.61/0.85  (step t536.t6.t1 (cl (not (= (< (+ (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ 9 11) (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ (- 30) 11) tptp.c) (* (/ 2 11) (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))))) (+ (* (- 1.0) 7) (* (/ 9 11) 1) (* (/ (- 30) 11) 1) (* (/ 2 11) 0))) false)) (not (< (+ (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ 9 11) (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ (- 30) 11) tptp.c) (* (/ 2 11) (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))))) (+ (* (- 1.0) 7) (* (/ 9 11) 1) (* (/ (- 30) 11) 1) (* (/ 2 11) 0)))) false) :rule equiv_pos2)
% 0.61/0.85  (step t536.t6.t2 (cl (= (< (+ (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ 9 11) (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ (- 30) 11) tptp.c) (* (/ 2 11) (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))))) (+ (* (- 1.0) 7) (* (/ 9 11) 1) (* (/ (- 30) 11) 1) (* (/ 2 11) 0))) (not (>= (+ (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ 9 11) (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ (- 30) 11) tptp.c) (* (/ 2 11) (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))))) (+ (* (- 1.0) 7) (* (/ 9 11) 1) (* (/ (- 30) 11) 1) (* (/ 2 11) 0)))))) :rule all_simplify)
% 0.61/0.85  (step t536.t6.t3 (cl (= (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (to_real (+ (* (- 2) tptp.d) (* (- 3) tptp.c) (* tptp.d tptp.c))))) :rule all_simplify)
% 0.61/0.85  (step t536.t6.t4 (cl (= (* (/ 9 11) (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (+ (* (/ 63 11) tptp.c) (* (/ (- 9) 11) (* tptp.d tptp.c))))) :rule all_simplify)
% 0.61/0.85  (step t536.t6.t5 (cl (= (* (/ (- 30) 11) tptp.c) (* (/ (- 30) 11) tptp.c))) :rule refl)
% 0.61/0.85  (step t536.t6.t6 (cl (= (* (/ 2 11) (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c)))) (+ (* 2 tptp.d) (* (/ (- 2) 11) (* tptp.d tptp.c))))) :rule all_simplify)
% 0.61/0.85  (step t536.t6.t7 (cl (= (+ (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ 9 11) (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ (- 30) 11) tptp.c) (* (/ 2 11) (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))))) (+ (to_real (+ (* (- 2) tptp.d) (* (- 3) tptp.c) (* tptp.d tptp.c))) (+ (* (/ 63 11) tptp.c) (* (/ (- 9) 11) (* tptp.d tptp.c))) (* (/ (- 30) 11) tptp.c) (+ (* 2 tptp.d) (* (/ (- 2) 11) (* tptp.d tptp.c)))))) :rule cong :premises (t536.t6.t3 t536.t6.t4 t536.t6.t5 t536.t6.t6))
% 0.61/0.85  (step t536.t6.t8 (cl (= (+ (to_real (+ (* (- 2) tptp.d) (* (- 3) tptp.c) (* tptp.d tptp.c))) (+ (* (/ 63 11) tptp.c) (* (/ (- 9) 11) (* tptp.d tptp.c))) (* (/ (- 30) 11) tptp.c) (+ (* 2 tptp.d) (* (/ (- 2) 11) (* tptp.d tptp.c)))) 0.0)) :rule all_simplify)
% 0.61/0.85  (step t536.t6.t9 (cl (= (+ (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ 9 11) (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ (- 30) 11) tptp.c) (* (/ 2 11) (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))))) 0.0)) :rule trans :premises (t536.t6.t7 t536.t6.t8))
% 0.61/0.85  (step t536.t6.t10 (cl (= (* (- 1.0) 7) (- 7.0))) :rule all_simplify)
% 0.61/0.85  (step t536.t6.t11 (cl (= (* (/ 9 11) 1) (/ 9 11))) :rule all_simplify)
% 0.61/0.85  (step t536.t6.t12 (cl (= (* (/ (- 30) 11) 1) (/ (- 30) 11))) :rule all_simplify)
% 0.61/0.85  (step t536.t6.t13 (cl (= (* (/ 2 11) 0) 0.0)) :rule all_simplify)
% 0.61/0.85  (step t536.t6.t14 (cl (= (+ (* (- 1.0) 7) (* (/ 9 11) 1) (* (/ (- 30) 11) 1) (* (/ 2 11) 0)) (+ (- 7.0) (/ 9 11) (/ (- 30) 11) 0.0))) :rule cong :premises (t536.t6.t10 t536.t6.t11 t536.t6.t12 t536.t6.t13))
% 0.61/0.85  (step t536.t6.t15 (cl (= (+ (- 7.0) (/ 9 11) (/ (- 30) 11) 0.0) (/ (- 98) 11))) :rule all_simplify)
% 0.61/0.85  (step t536.t6.t16 (cl (= (+ (* (- 1.0) 7) (* (/ 9 11) 1) (* (/ (- 30) 11) 1) (* (/ 2 11) 0)) (/ (- 98) 11))) :rule trans :premises (t536.t6.t14 t536.t6.t15))
% 0.61/0.85  (step t536.t6.t17 (cl (= (>= (+ (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ 9 11) (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ (- 30) 11) tptp.c) (* (/ 2 11) (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))))) (+ (* (- 1.0) 7) (* (/ 9 11) 1) (* (/ (- 30) 11) 1) (* (/ 2 11) 0))) (>= 0.0 (/ (- 98) 11)))) :rule cong :premises (t536.t6.t9 t536.t6.t16))
% 0.61/0.85  (step t536.t6.t18 (cl (= (>= 0.0 (/ (- 98) 11)) true)) :rule all_simplify)
% 0.61/0.85  (step t536.t6.t19 (cl (= (>= (+ (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ 9 11) (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ (- 30) 11) tptp.c) (* (/ 2 11) (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))))) (+ (* (- 1.0) 7) (* (/ 9 11) 1) (* (/ (- 30) 11) 1) (* (/ 2 11) 0))) true)) :rule trans :premises (t536.t6.t17 t536.t6.t18))
% 0.61/0.85  (step t536.t6.t20 (cl (= (not (>= (+ (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ 9 11) (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ (- 30) 11) tptp.c) (* (/ 2 11) (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))))) (+ (* (- 1.0) 7) (* (/ 9 11) 1) (* (/ (- 30) 11) 1) (* (/ 2 11) 0)))) (not true))) :rule cong :premises (t536.t6.t19))
% 0.61/0.85  (step t536.t6.t21 (cl (= (not true) false)) :rule all_simplify)
% 0.61/0.85  (step t536.t6.t22 (cl (= (not (>= (+ (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ 9 11) (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ (- 30) 11) tptp.c) (* (/ 2 11) (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))))) (+ (* (- 1.0) 7) (* (/ 9 11) 1) (* (/ (- 30) 11) 1) (* (/ 2 11) 0)))) false)) :rule trans :premises (t536.t6.t20 t536.t6.t21))
% 0.61/0.85  (step t536.t6.t23 (cl (= (< (+ (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ 9 11) (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ (- 30) 11) tptp.c) (* (/ 2 11) (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))))) (+ (* (- 1.0) 7) (* (/ 9 11) 1) (* (/ (- 30) 11) 1) (* (/ 2 11) 0))) false)) :rule trans :premises (t536.t6.t2 t536.t6.t22))
% 0.61/0.85  (step t536.t6.t24 (cl (not (<= (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) 7))) (not (< (* (/ 9 11) (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ 9 11) 1))) (not (<= (* (/ (- 30) 11) tptp.c) (* (/ (- 30) 11) 1))) (not (< (* (/ 2 11) (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c)))) (* (/ 2 11) 0))) (< (+ (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ 9 11) (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ (- 30) 11) tptp.c) (* (/ 2 11) (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))))) (+ (* (- 1.0) 7) (* (/ 9 11) 1) (* (/ (- 30) 11) 1) (* (/ 2 11) 0)))) :rule la_generic :args (1 1 1 1 1))
% 0.61/0.85  (step t536.t6.t25 (cl (=> (and (< (- 1.0) 0) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (<= (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) 7)))) :rule la_mult_neg)
% 0.61/0.85  (step t536.t6.t26 (cl (not (and (< (- 1.0) 0) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (<= (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) 7))) :rule implies :premises (t536.t6.t25))
% 0.61/0.85  (step t536.t6.t27 (cl (and (< (- 1.0) 0) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (< (- 1.0) 0)) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule and_neg)
% 0.61/0.85  (step t536.t6.t28 (cl (= (= (< (- 1.0) 0) true) (< (- 1.0) 0))) :rule equiv_simplify)
% 0.61/0.85  (step t536.t6.t29 (cl (not (= (< (- 1.0) 0) true)) (< (- 1.0) 0)) :rule equiv1 :premises (t536.t6.t28))
% 0.61/0.85  (step t536.t6.t30 (cl (= (< (- 1.0) 0) true)) :rule hole :args ((< (- 1.0) 0)))
% 0.61/0.85  (step t536.t6.t31 (cl (< (- 1.0) 0)) :rule resolution :premises (t536.t6.t29 t536.t6.t30))
% 0.61/0.85  (step t536.t6.t32 (cl (and (< (- 1.0) 0) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule resolution :premises (t536.t6.t27 t536.t6.t31 t536.t6.a0))
% 0.61/0.85  (step t536.t6.t33 (cl (<= (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) 7))) :rule resolution :premises (t536.t6.t26 t536.t6.t32))
% 0.61/0.85  (step t536.t6.t34 (cl (=> (and (> (/ 9 11) 0) (< (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (< (* (/ 9 11) (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ 9 11) 1)))) :rule la_mult_pos)
% 0.61/0.85  (step t536.t6.t35 (cl (not (and (> (/ 9 11) 0) (< (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (< (* (/ 9 11) (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ 9 11) 1))) :rule implies :premises (t536.t6.t34))
% 0.61/0.85  (step t536.t6.t36 (cl (and (> (/ 9 11) 0) (< (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (> (/ 9 11) 0)) (not (< (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) :rule and_neg)
% 0.61/0.85  (step t536.t6.t37 (cl (= (= (> (/ 9 11) 0) true) (> (/ 9 11) 0))) :rule equiv_simplify)
% 0.61/0.85  (step t536.t6.t38 (cl (not (= (> (/ 9 11) 0) true)) (> (/ 9 11) 0)) :rule equiv1 :premises (t536.t6.t37))
% 0.61/0.85  (step t536.t6.t39 (cl (= (> (/ 9 11) 0) true)) :rule hole :args ((> (/ 9 11) 0)))
% 0.61/0.85  (step t536.t6.t40 (cl (> (/ 9 11) 0)) :rule resolution :premises (t536.t6.t38 t536.t6.t39))
% 0.61/0.85  (step t536.t6.t41 (cl (not (= (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (< (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (< (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) :rule equiv_pos2)
% 0.61/0.85  (step t536.t6.t42 (cl (= (< (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)))) :rule all_simplify)
% 0.61/0.85  (step t536.t6.t43 (cl (= (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (< (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) :rule symm :premises (t536.t6.t42))
% 0.61/0.85  (step t536.t6.t44 (cl (< (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) :rule resolution :premises (t536.t6.t41 t536.t6.t43 t536.a2))
% 0.61/0.85  (step t536.t6.t45 (cl (and (> (/ 9 11) 0) (< (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) :rule resolution :premises (t536.t6.t36 t536.t6.t40 t536.t6.t44))
% 0.61/0.85  (step t536.t6.t46 (cl (< (* (/ 9 11) (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ 9 11) 1))) :rule resolution :premises (t536.t6.t35 t536.t6.t45))
% 0.61/0.85  (step t536.t6.t47 (cl (=> (and (< (/ (- 30) 11) 0) (>= tptp.c 1)) (<= (* (/ (- 30) 11) tptp.c) (* (/ (- 30) 11) 1)))) :rule la_mult_neg)
% 0.61/0.85  (step t536.t6.t48 (cl (not (and (< (/ (- 30) 11) 0) (>= tptp.c 1))) (<= (* (/ (- 30) 11) tptp.c) (* (/ (- 30) 11) 1))) :rule implies :premises (t536.t6.t47))
% 0.61/0.85  (step t536.t6.t49 (cl (and (< (/ (- 30) 11) 0) (>= tptp.c 1)) (not (< (/ (- 30) 11) 0)) (not (>= tptp.c 1))) :rule and_neg)
% 0.61/0.85  (step t536.t6.t50 (cl (= (= (< (/ (- 30) 11) 0) true) (< (/ (- 30) 11) 0))) :rule equiv_simplify)
% 0.61/0.85  (step t536.t6.t51 (cl (not (= (< (/ (- 30) 11) 0) true)) (< (/ (- 30) 11) 0)) :rule equiv1 :premises (t536.t6.t50))
% 0.61/0.85  (step t536.t6.t52 (cl (= (< (/ (- 30) 11) 0) true)) :rule hole :args ((< (/ (- 30) 11) 0)))
% 0.61/0.85  (step t536.t6.t53 (cl (< (/ (- 30) 11) 0)) :rule resolution :premises (t536.t6.t51 t536.t6.t52))
% 0.61/0.85  (step t536.t6.t54 (cl (and (< (/ (- 30) 11) 0) (>= tptp.c 1))) :rule resolution :premises (t536.t6.t49 t536.t6.t53 t536.a1))
% 0.61/0.85  (step t536.t6.t55 (cl (<= (* (/ (- 30) 11) tptp.c) (* (/ (- 30) 11) 1))) :rule resolution :premises (t536.t6.t48 t536.t6.t54))
% 0.61/0.85  (step t536.t6.t56 (cl (=> (and (> (/ 2 11) 0) (< (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)) (< (* (/ 2 11) (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c)))) (* (/ 2 11) 0)))) :rule la_mult_pos)
% 0.61/0.85  (step t536.t6.t57 (cl (not (and (> (/ 2 11) 0) (< (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0))) (< (* (/ 2 11) (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c)))) (* (/ 2 11) 0))) :rule implies :premises (t536.t6.t56))
% 0.61/0.85  (step t536.t6.t58 (cl (and (> (/ 2 11) 0) (< (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)) (not (> (/ 2 11) 0)) (not (< (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0))) :rule and_neg)
% 0.61/0.85  (step t536.t6.t59 (cl (= (= (> (/ 2 11) 0) true) (> (/ 2 11) 0))) :rule equiv_simplify)
% 0.61/0.85  (step t536.t6.t60 (cl (not (= (> (/ 2 11) 0) true)) (> (/ 2 11) 0)) :rule equiv1 :premises (t536.t6.t59))
% 0.61/0.85  (step t536.t6.t61 (cl (= (> (/ 2 11) 0) true)) :rule hole :args ((> (/ 2 11) 0)))
% 0.61/0.85  (step t536.t6.t62 (cl (> (/ 2 11) 0)) :rule resolution :premises (t536.t6.t60 t536.t6.t61))
% 0.61/0.85  (step t536.t6.t63 (cl (not (= (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)) (< (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0))) (not (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0))) (< (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)) :rule equiv_pos2)
% 0.61/0.85  (step t536.t6.t64 (cl (= (< (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0) (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)))) :rule all_simplify)
% 0.61/0.85  (step t536.t6.t65 (cl (= (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)) (< (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0))) :rule symm :premises (t536.t6.t64))
% 0.61/0.85  (step t536.t6.t66 (cl (< (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)) :rule resolution :premises (t536.t6.t63 t536.t6.t65 t536.a0))
% 0.61/0.85  (step t536.t6.t67 (cl (and (> (/ 2 11) 0) (< (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0))) :rule resolution :premises (t536.t6.t58 t536.t6.t62 t536.t6.t66))
% 0.61/0.85  (step t536.t6.t68 (cl (< (* (/ 2 11) (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c)))) (* (/ 2 11) 0))) :rule resolution :premises (t536.t6.t57 t536.t6.t67))
% 0.61/0.85  (step t536.t6.t69 (cl (< (+ (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ 9 11) (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ (- 30) 11) tptp.c) (* (/ 2 11) (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))))) (+ (* (- 1.0) 7) (* (/ 9 11) 1) (* (/ (- 30) 11) 1) (* (/ 2 11) 0)))) :rule resolution :premises (t536.t6.t24 t536.t6.t33 t536.t6.t46 t536.t6.t55 t536.t6.t68))
% 0.61/0.85  (step t536.t6.t70 (cl false) :rule resolution :premises (t536.t6.t1 t536.t6.t23 t536.t6.t69))
% 0.61/0.85  (step t536.t6 (cl (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) false) :rule subproof :discharge (t536.t6.a0))
% 0.61/0.85  (step t536.t7 (cl (=> (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) false) false) :rule resolution :premises (t536.t5 t536.t6))
% 0.61/0.85  (step t536.t8 (cl (=> (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) false) (not false)) :rule implies_neg2)
% 0.61/0.85  (step t536.t9 (cl (=> (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) false) (=> (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) false)) :rule resolution :premises (t536.t7 t536.t8))
% 0.61/0.85  (step t536.t10 (cl (=> (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) false)) :rule contraction :premises (t536.t9))
% 0.61/0.85  (step t536.t11 (cl (= (=> (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) false) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)))) :rule implies_simplify)
% 0.61/0.85  (step t536.t12 (cl (not (=> (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) false)) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule equiv1 :premises (t536.t11))
% 0.61/0.85  (step t536.t13 (cl (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule resolution :premises (t536.t10 t536.t12))
% 0.61/0.85  (step t536.t14 (cl (< (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) :rule resolution :premises (t536.t3 t536.t4 t536.t13))
% 0.61/0.85  (step t536.t15 (cl (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule resolution :premises (t536.t1 t536.t2 t536.t14))
% 0.61/0.85  (step t536.t16 (cl) :rule resolution :premises (t536.a3 t536.t15))
% 0.61/0.85  (step t536 (cl (not (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0))) (not (>= tptp.c 1)) (not (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) false) :rule subproof :discharge (t536.a0 t536.a1 t536.a2 t536.a3))
% 0.61/0.85  (step t537 (cl (not (and (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0))) :rule and_pos)
% 0.61/0.85  (step t538 (cl (not (and (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (>= tptp.c 1)) :rule and_pos)
% 0.61/0.85  (step t539 (cl (not (and (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) :rule and_pos)
% 0.61/0.85  (step t540 (cl (not (and (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) :rule and_pos)
% 0.61/0.85  (step t541 (cl false (not (and (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (not (and (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (not (and (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (not (and (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)))) :rule resolution :premises (t536 t537 t538 t539 t540))
% 0.61/0.85  (step t542 (cl (not (and (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (not (and (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (not (and (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (not (and (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) false) :rule reordering :premises (t541))
% 0.61/0.85  (step t543 (cl (not (and (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) false) :rule contraction :premises (t542))
% 0.61/0.85  (step t544 (cl (=> (and (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) false) false) :rule resolution :premises (t535 t543))
% 0.61/0.85  (step t545 (cl (=> (and (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) false) (not false)) :rule implies_neg2)
% 0.61/0.85  (step t546 (cl (=> (and (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) false) (=> (and (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) false)) :rule resolution :premises (t544 t545))
% 0.61/0.85  (step t547 (cl (=> (and (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) false)) :rule contraction :premises (t546))
% 0.61/0.85  (step t548 (cl (= (=> (and (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) false) (not (and (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))))) :rule implies_simplify)
% 0.61/0.85  (step t549 (cl (not (=> (and (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) false)) (not (and (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)))) :rule equiv1 :premises (t548))
% 0.61/0.85  (step t550 (cl (not (and (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)))) :rule resolution :premises (t547 t549))
% 0.61/0.85  (step t551 (cl (= (and (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) false)) :rule resolution :premises (t534 t550))
% 0.61/0.85  (step t552 (cl (= (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0))) (and (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0))) false))) :rule cong :premises (t530 t551))
% 0.61/0.85  (step t553 (cl (= (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0))) false) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)))))) :rule all_simplify)
% 0.61/0.85  (step t554 (cl (= (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0))) (and (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)))))) :rule trans :premises (t552 t553))
% 0.61/0.85  (step t555 (cl (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0))) (and (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)))) :rule implies_neg1)
% 0.61/0.85  (anchor :step t556)
% 0.61/0.85  (assume t556.a0 (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))
% 0.61/0.85  (assume t556.a1 (>= tptp.c 1))
% 0.61/0.85  (assume t556.a2 (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)))
% 0.61/0.85  (assume t556.a3 (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)))
% 0.61/0.85  (step t556.t1 (cl (and (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0))) (not (>= tptp.c 1)) (not (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule and_neg)
% 0.61/0.85  (step t556.t2 (cl (and (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule resolution :premises (t556.t1 t556.a3 t556.a1 t556.a2 t556.a0))
% 0.61/0.85  (step t556 (cl (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (>= tptp.c 1)) (not (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0))) (and (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule subproof :discharge (t556.a0 t556.a1 t556.a2 t556.a3))
% 0.61/0.85  (step t557 (cl (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)))) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) :rule and_pos)
% 0.61/0.85  (step t558 (cl (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)))) (>= tptp.c 1)) :rule and_pos)
% 0.61/0.85  (step t559 (cl (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)))) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) :rule and_pos)
% 0.61/0.85  (step t560 (cl (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)))) (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0))) :rule and_pos)
% 0.61/0.85  (step t561 (cl (and (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0))))) :rule resolution :premises (t556 t557 t558 t559 t560))
% 0.61/0.85  (step t562 (cl (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)))) (and (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule reordering :premises (t561))
% 0.61/0.85  (step t563 (cl (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)))) (and (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule contraction :premises (t562))
% 0.61/0.85  (step t564 (cl (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0))) (and (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (and (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule resolution :premises (t555 t563))
% 0.61/0.85  (step t565 (cl (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0))) (and (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (not (and (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)))) :rule implies_neg2)
% 0.61/0.85  (step t566 (cl (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0))) (and (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0))) (and (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)))) :rule resolution :premises (t564 t565))
% 0.61/0.85  (step t567 (cl (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0))) (and (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)))) :rule contraction :premises (t566))
% 0.61/0.85  (step t568 (cl (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (>= tptp.c 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0))))) :rule resolution :premises (t529 t554 t567))
% 0.61/0.85  (step t569 (cl (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (>= tptp.c 1)) (not (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)))) :rule not_and :premises (t568))
% 0.61/0.85  (step t570 (cl (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (>= tptp.c 1)) (not (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)))) (not (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)))) :rule or_neg)
% 0.61/0.85  (step t571 (cl (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (>= tptp.c 1)) (not (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)))) (not (not (>= tptp.c 1)))) :rule or_neg)
% 0.61/0.85  (step t572 (cl (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (>= tptp.c 1)) (not (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)))) (not (not (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))))) :rule or_neg)
% 0.61/0.85  (step t573 (cl (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (>= tptp.c 1)) (not (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)))) (not (not (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0))))) :rule or_neg)
% 0.61/0.85  (step t574 (cl (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (>= tptp.c 1)) (not (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)))) (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (>= tptp.c 1)) (not (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)))) (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (>= tptp.c 1)) (not (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)))) (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (>= tptp.c 1)) (not (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0))))) :rule resolution :premises (t569 t570 t571 t572 t573))
% 0.61/0.85  (step t575 (cl (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (>= tptp.c 1)) (not (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0))))) :rule contraction :premises (t574))
% 0.61/0.85  (step t576 (cl (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (>= tptp.c 1)) (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1) (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0))) :rule resolution :premises (t506 t528 t575))
% 0.61/0.85  (step t577 (cl (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (>= tptp.c 1)) (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1) (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)) :rule or :premises (t576))
% 0.61/0.85  (step t578 (cl (not (= (or (not (>= tptp.c 2)) (not (not (>= tptp.c 1)))) (or (not (>= tptp.c 2)) (>= tptp.c 1)))) (not (or (not (>= tptp.c 2)) (not (not (>= tptp.c 1))))) (or (not (>= tptp.c 2)) (>= tptp.c 1))) :rule equiv_pos2)
% 0.61/0.85  (step t579 (cl (= (= (= (not (not (>= tptp.c 1))) (>= tptp.c 1)) true) (= (not (not (>= tptp.c 1))) (>= tptp.c 1)))) :rule equiv_simplify)
% 0.61/0.85  (step t580 (cl (not (= (= (not (not (>= tptp.c 1))) (>= tptp.c 1)) true)) (= (not (not (>= tptp.c 1))) (>= tptp.c 1))) :rule equiv1 :premises (t579))
% 0.61/0.85  (step t581 (cl (= (= (not (not (>= tptp.c 1))) (>= tptp.c 1)) (= (>= tptp.c 1) (not (not (>= tptp.c 1)))))) :rule all_simplify)
% 0.61/0.85  (step t582 (cl (= (>= tptp.c 1) (>= tptp.c 1))) :rule refl)
% 0.61/0.85  (step t583 (cl (= (not (not (>= tptp.c 1))) (>= tptp.c 1))) :rule all_simplify)
% 0.61/0.85  (step t584 (cl (= (= (>= tptp.c 1) (not (not (>= tptp.c 1)))) (= (>= tptp.c 1) (>= tptp.c 1)))) :rule cong :premises (t582 t583))
% 0.61/0.85  (step t585 (cl (= (= (>= tptp.c 1) (>= tptp.c 1)) true)) :rule all_simplify)
% 0.61/0.85  (step t586 (cl (= (= (>= tptp.c 1) (not (not (>= tptp.c 1)))) true)) :rule trans :premises (t584 t585))
% 0.61/0.85  (step t587 (cl (= (= (not (not (>= tptp.c 1))) (>= tptp.c 1)) true)) :rule trans :premises (t581 t586))
% 0.61/0.85  (step t588 (cl (= (not (not (>= tptp.c 1))) (>= tptp.c 1))) :rule resolution :premises (t580 t587))
% 0.61/0.85  (step t589 (cl (= (or (not (>= tptp.c 2)) (not (not (>= tptp.c 1)))) (or (not (>= tptp.c 2)) (>= tptp.c 1)))) :rule cong :premises (t155 t588))
% 0.61/0.85  (step t590 (cl (not (= (=> (and (>= tptp.c 2) (not (>= tptp.c 1))) (and (not (>= tptp.c 1)) (>= tptp.c 2))) (not (and (>= tptp.c 2) (not (>= tptp.c 1)))))) (not (=> (and (>= tptp.c 2) (not (>= tptp.c 1))) (and (not (>= tptp.c 1)) (>= tptp.c 2)))) (not (and (>= tptp.c 2) (not (>= tptp.c 1))))) :rule equiv_pos2)
% 0.61/0.85  (step t591 (cl (= (and (>= tptp.c 2) (not (>= tptp.c 1))) (and (>= tptp.c 2) (not (>= tptp.c 1))))) :rule refl)
% 0.61/0.85  (step t592 (cl (= (= (and (not (>= tptp.c 1)) (>= tptp.c 2)) false) (not (and (not (>= tptp.c 1)) (>= tptp.c 2))))) :rule equiv_simplify)
% 0.61/0.85  (step t593 (cl (= (and (not (>= tptp.c 1)) (>= tptp.c 2)) false) (not (not (and (not (>= tptp.c 1)) (>= tptp.c 2))))) :rule equiv2 :premises (t592))
% 0.61/0.85  (step t594 (cl (not (not (not (and (not (>= tptp.c 1)) (>= tptp.c 2))))) (and (not (>= tptp.c 1)) (>= tptp.c 2))) :rule not_not)
% 0.61/0.85  (step t595 (cl (= (and (not (>= tptp.c 1)) (>= tptp.c 2)) false) (and (not (>= tptp.c 1)) (>= tptp.c 2))) :rule resolution :premises (t593 t594))
% 0.61/0.85  (step t596 (cl (=> (and (not (>= tptp.c 1)) (>= tptp.c 2)) false) (and (not (>= tptp.c 1)) (>= tptp.c 2))) :rule implies_neg1)
% 0.61/0.85  (anchor :step t597)
% 0.61/0.85  (assume t597.a0 (not (>= tptp.c 1)))
% 0.61/0.85  (assume t597.a1 (>= tptp.c 2))
% 0.61/0.85  (step t597.t1 (cl (not (= (not (<= tptp.c 0)) (> tptp.c 0))) (not (not (<= tptp.c 0))) (> tptp.c 0)) :rule equiv_pos2)
% 0.61/0.85  (step t597.t2 (cl (= (<= tptp.c 0) (not (>= tptp.c 1)))) :rule all_simplify)
% 0.61/0.85  (step t597.t3 (cl (= (not (<= tptp.c 0)) (not (not (>= tptp.c 1))))) :rule cong :premises (t597.t2))
% 0.61/0.85  (step t597.t4 (cl (= (not (<= tptp.c 0)) (>= tptp.c 1))) :rule trans :premises (t597.t3 t583))
% 0.61/0.85  (step t597.t5 (cl (= (> tptp.c 0) (not (<= tptp.c 0)))) :rule all_simplify)
% 0.61/0.85  (step t597.t6 (cl (= (> tptp.c 0) (>= tptp.c 1))) :rule trans :premises (t597.t5 t597.t4))
% 0.61/0.85  (step t597.t7 (cl (= (>= tptp.c 1) (> tptp.c 0))) :rule symm :premises (t597.t6))
% 0.61/0.85  (step t597.t8 (cl (= (not (<= tptp.c 0)) (> tptp.c 0))) :rule trans :premises (t597.t4 t597.t7))
% 0.61/0.85  (step t597.t9 (cl (=> (<= tptp.c 0) false) (<= tptp.c 0)) :rule implies_neg1)
% 0.61/0.85  (anchor :step t597.t10)
% 0.61/0.85  (assume t597.t10.a0 (<= tptp.c 0))
% 0.61/0.85  (step t597.t10.t1 (cl (not (= (<= (+ (* 1.0 tptp.c) (* (- 1.0) tptp.c)) (+ (* 1.0 0) (* (- 1.0) 2))) false)) (not (<= (+ (* 1.0 tptp.c) (* (- 1.0) tptp.c)) (+ (* 1.0 0) (* (- 1.0) 2)))) false) :rule equiv_pos2)
% 0.61/0.85  (step t597.t10.t2 (cl (= (* 1.0 tptp.c) (to_real tptp.c))) :rule all_simplify)
% 0.61/0.85  (step t597.t10.t3 (cl (= (* (- 1.0) tptp.c) (to_real (* (- 1) tptp.c)))) :rule all_simplify)
% 0.61/0.85  (step t597.t10.t4 (cl (= (+ (* 1.0 tptp.c) (* (- 1.0) tptp.c)) (+ (to_real tptp.c) (to_real (* (- 1) tptp.c))))) :rule cong :premises (t597.t10.t2 t597.t10.t3))
% 0.61/0.85  (step t597.t10.t5 (cl (= (+ (to_real tptp.c) (to_real (* (- 1) tptp.c))) 0.0)) :rule all_simplify)
% 0.61/0.85  (step t597.t10.t6 (cl (= (+ (* 1.0 tptp.c) (* (- 1.0) tptp.c)) 0.0)) :rule trans :premises (t597.t10.t4 t597.t10.t5))
% 0.61/0.85  (step t597.t10.t7 (cl (= (* 1.0 0) 0.0)) :rule all_simplify)
% 0.61/0.85  (step t597.t10.t8 (cl (= (* (- 1.0) 2) (- 2.0))) :rule all_simplify)
% 0.61/0.85  (step t597.t10.t9 (cl (= (+ (* 1.0 0) (* (- 1.0) 2)) (+ 0.0 (- 2.0)))) :rule cong :premises (t597.t10.t7 t597.t10.t8))
% 0.61/0.85  (step t597.t10.t10 (cl (= (+ 0.0 (- 2.0)) (- 2.0))) :rule all_simplify)
% 0.61/0.85  (step t597.t10.t11 (cl (= (+ (* 1.0 0) (* (- 1.0) 2)) (- 2.0))) :rule trans :premises (t597.t10.t9 t597.t10.t10))
% 0.61/0.85  (step t597.t10.t12 (cl (= (<= (+ (* 1.0 tptp.c) (* (- 1.0) tptp.c)) (+ (* 1.0 0) (* (- 1.0) 2))) (<= 0.0 (- 2.0)))) :rule cong :premises (t597.t10.t6 t597.t10.t11))
% 0.61/0.85  (step t597.t10.t13 (cl (= (<= 0.0 (- 2.0)) false)) :rule all_simplify)
% 0.61/0.85  (step t597.t10.t14 (cl (= (<= (+ (* 1.0 tptp.c) (* (- 1.0) tptp.c)) (+ (* 1.0 0) (* (- 1.0) 2))) false)) :rule trans :premises (t597.t10.t12 t597.t10.t13))
% 0.61/0.85  (step t597.t10.t15 (cl (not (<= (* 1.0 tptp.c) (* 1.0 0))) (not (<= (* (- 1.0) tptp.c) (* (- 1.0) 2))) (<= (+ (* 1.0 tptp.c) (* (- 1.0) tptp.c)) (+ (* 1.0 0) (* (- 1.0) 2)))) :rule la_generic :args (1 1 1))
% 0.61/0.85  (step t597.t10.t16 (cl (=> (and (> 1.0 0) (<= tptp.c 0)) (<= (* 1.0 tptp.c) (* 1.0 0)))) :rule la_mult_pos)
% 0.61/0.85  (step t597.t10.t17 (cl (not (and (> 1.0 0) (<= tptp.c 0))) (<= (* 1.0 tptp.c) (* 1.0 0))) :rule implies :premises (t597.t10.t16))
% 0.61/0.85  (step t597.t10.t18 (cl (and (> 1.0 0) (<= tptp.c 0)) (not (> 1.0 0)) (not (<= tptp.c 0))) :rule and_neg)
% 0.61/0.85  (step t597.t10.t19 (cl (= (= (> 1.0 0) true) (> 1.0 0))) :rule equiv_simplify)
% 0.61/0.85  (step t597.t10.t20 (cl (not (= (> 1.0 0) true)) (> 1.0 0)) :rule equiv1 :premises (t597.t10.t19))
% 0.61/0.85  (step t597.t10.t21 (cl (= (> 1.0 0) true)) :rule hole :args ((> 1.0 0)))
% 0.61/0.85  (step t597.t10.t22 (cl (> 1.0 0)) :rule resolution :premises (t597.t10.t20 t597.t10.t21))
% 0.61/0.85  (step t597.t10.t23 (cl (and (> 1.0 0) (<= tptp.c 0))) :rule resolution :premises (t597.t10.t18 t597.t10.t22 t597.t10.a0))
% 0.61/0.85  (step t597.t10.t24 (cl (<= (* 1.0 tptp.c) (* 1.0 0))) :rule resolution :premises (t597.t10.t17 t597.t10.t23))
% 0.61/0.85  (step t597.t10.t25 (cl (=> (and (< (- 1.0) 0) (>= tptp.c 2)) (<= (* (- 1.0) tptp.c) (* (- 1.0) 2)))) :rule la_mult_neg)
% 0.61/0.85  (step t597.t10.t26 (cl (not (and (< (- 1.0) 0) (>= tptp.c 2))) (<= (* (- 1.0) tptp.c) (* (- 1.0) 2))) :rule implies :premises (t597.t10.t25))
% 0.61/0.85  (step t597.t10.t27 (cl (and (< (- 1.0) 0) (>= tptp.c 2)) (not (< (- 1.0) 0)) (not (>= tptp.c 2))) :rule and_neg)
% 0.61/0.85  (step t597.t10.t28 (cl (= (= (< (- 1.0) 0) true) (< (- 1.0) 0))) :rule equiv_simplify)
% 0.61/0.85  (step t597.t10.t29 (cl (not (= (< (- 1.0) 0) true)) (< (- 1.0) 0)) :rule equiv1 :premises (t597.t10.t28))
% 0.61/0.85  (step t597.t10.t30 (cl (= (< (- 1.0) 0) true)) :rule hole :args ((< (- 1.0) 0)))
% 0.61/0.85  (step t597.t10.t31 (cl (< (- 1.0) 0)) :rule resolution :premises (t597.t10.t29 t597.t10.t30))
% 0.61/0.85  (step t597.t10.t32 (cl (and (< (- 1.0) 0) (>= tptp.c 2))) :rule resolution :premises (t597.t10.t27 t597.t10.t31 t597.a1))
% 0.61/0.85  (step t597.t10.t33 (cl (<= (* (- 1.0) tptp.c) (* (- 1.0) 2))) :rule resolution :premises (t597.t10.t26 t597.t10.t32))
% 0.61/0.85  (step t597.t10.t34 (cl (<= (+ (* 1.0 tptp.c) (* (- 1.0) tptp.c)) (+ (* 1.0 0) (* (- 1.0) 2)))) :rule resolution :premises (t597.t10.t15 t597.t10.t24 t597.t10.t33))
% 0.61/0.85  (step t597.t10.t35 (cl false) :rule resolution :premises (t597.t10.t1 t597.t10.t14 t597.t10.t34))
% 0.61/0.85  (step t597.t10 (cl (not (<= tptp.c 0)) false) :rule subproof :discharge (t597.t10.a0))
% 0.61/0.85  (step t597.t11 (cl (=> (<= tptp.c 0) false) false) :rule resolution :premises (t597.t9 t597.t10))
% 0.61/0.85  (step t597.t12 (cl (=> (<= tptp.c 0) false) (not false)) :rule implies_neg2)
% 0.61/0.85  (step t597.t13 (cl (=> (<= tptp.c 0) false) (=> (<= tptp.c 0) false)) :rule resolution :premises (t597.t11 t597.t12))
% 0.61/0.85  (step t597.t14 (cl (=> (<= tptp.c 0) false)) :rule contraction :premises (t597.t13))
% 0.61/0.85  (step t597.t15 (cl (= (=> (<= tptp.c 0) false) (not (<= tptp.c 0)))) :rule implies_simplify)
% 0.61/0.85  (step t597.t16 (cl (not (=> (<= tptp.c 0) false)) (not (<= tptp.c 0))) :rule equiv1 :premises (t597.t15))
% 0.61/0.85  (step t597.t17 (cl (not (<= tptp.c 0))) :rule resolution :premises (t597.t14 t597.t16))
% 0.61/0.85  (step t597.t18 (cl (> tptp.c 0)) :rule resolution :premises (t597.t1 t597.t8 t597.t17))
% 0.61/0.85  (step t597.t19 (cl (not (= (<= tptp.c 0) (not (> tptp.c 0)))) (not (<= tptp.c 0)) (not (> tptp.c 0))) :rule equiv_pos2)
% 0.61/0.85  (step t597.t20 (cl (= (not (> tptp.c 0)) (not (>= tptp.c 1)))) :rule cong :premises (t597.t6))
% 0.61/0.85  (step t597.t21 (cl (= (not (>= tptp.c 1)) (not (> tptp.c 0)))) :rule symm :premises (t597.t20))
% 0.61/0.85  (step t597.t22 (cl (= (<= tptp.c 0) (not (> tptp.c 0)))) :rule trans :premises (t597.t2 t597.t21))
% 0.61/0.85  (step t597.t23 (cl (not (< tptp.c 1)) (<= tptp.c 0)) :rule la_generic :args (1 1))
% 0.61/0.85  (step t597.t24 (cl (not (= (not (>= tptp.c 1)) (< tptp.c 1))) (not (not (>= tptp.c 1))) (< tptp.c 1)) :rule equiv_pos2)
% 0.61/0.85  (step t597.t25 (cl (= (< tptp.c 1) (not (>= tptp.c 1)))) :rule all_simplify)
% 0.61/0.85  (step t597.t26 (cl (= (not (>= tptp.c 1)) (< tptp.c 1))) :rule symm :premises (t597.t25))
% 0.61/0.85  (step t597.t27 (cl (< tptp.c 1)) :rule resolution :premises (t597.t24 t597.t26 t597.a0))
% 0.61/0.85  (step t597.t28 (cl (<= tptp.c 0)) :rule resolution :premises (t597.t23 t597.t27))
% 0.61/0.85  (step t597.t29 (cl (not (> tptp.c 0))) :rule resolution :premises (t597.t19 t597.t22 t597.t28))
% 0.61/0.85  (step t597.t30 (cl) :rule resolution :premises (t597.t18 t597.t29))
% 0.61/0.85  (step t597 (cl (not (not (>= tptp.c 1))) (not (>= tptp.c 2)) false) :rule subproof :discharge (t597.a0 t597.a1))
% 0.61/0.85  (step t598 (cl (not (and (not (>= tptp.c 1)) (>= tptp.c 2))) (not (>= tptp.c 1))) :rule and_pos)
% 0.61/0.85  (step t599 (cl (not (and (not (>= tptp.c 1)) (>= tptp.c 2))) (>= tptp.c 2)) :rule and_pos)
% 0.61/0.85  (step t600 (cl false (not (and (not (>= tptp.c 1)) (>= tptp.c 2))) (not (and (not (>= tptp.c 1)) (>= tptp.c 2)))) :rule resolution :premises (t597 t598 t599))
% 0.61/0.85  (step t601 (cl (not (and (not (>= tptp.c 1)) (>= tptp.c 2))) (not (and (not (>= tptp.c 1)) (>= tptp.c 2))) false) :rule reordering :premises (t600))
% 0.61/0.85  (step t602 (cl (not (and (not (>= tptp.c 1)) (>= tptp.c 2))) false) :rule contraction :premises (t601))
% 0.61/0.85  (step t603 (cl (=> (and (not (>= tptp.c 1)) (>= tptp.c 2)) false) false) :rule resolution :premises (t596 t602))
% 0.61/0.85  (step t604 (cl (=> (and (not (>= tptp.c 1)) (>= tptp.c 2)) false) (not false)) :rule implies_neg2)
% 0.61/0.85  (step t605 (cl (=> (and (not (>= tptp.c 1)) (>= tptp.c 2)) false) (=> (and (not (>= tptp.c 1)) (>= tptp.c 2)) false)) :rule resolution :premises (t603 t604))
% 0.61/0.85  (step t606 (cl (=> (and (not (>= tptp.c 1)) (>= tptp.c 2)) false)) :rule contraction :premises (t605))
% 0.61/0.85  (step t607 (cl (= (=> (and (not (>= tptp.c 1)) (>= tptp.c 2)) false) (not (and (not (>= tptp.c 1)) (>= tptp.c 2))))) :rule implies_simplify)
% 0.61/0.85  (step t608 (cl (not (=> (and (not (>= tptp.c 1)) (>= tptp.c 2)) false)) (not (and (not (>= tptp.c 1)) (>= tptp.c 2)))) :rule equiv1 :premises (t607))
% 0.61/0.85  (step t609 (cl (not (and (not (>= tptp.c 1)) (>= tptp.c 2)))) :rule resolution :premises (t606 t608))
% 0.61/0.85  (step t610 (cl (= (and (not (>= tptp.c 1)) (>= tptp.c 2)) false)) :rule resolution :premises (t595 t609))
% 0.61/0.85  (step t611 (cl (= (=> (and (>= tptp.c 2) (not (>= tptp.c 1))) (and (not (>= tptp.c 1)) (>= tptp.c 2))) (=> (and (>= tptp.c 2) (not (>= tptp.c 1))) false))) :rule cong :premises (t591 t610))
% 0.61/0.85  (step t612 (cl (= (=> (and (>= tptp.c 2) (not (>= tptp.c 1))) false) (not (and (>= tptp.c 2) (not (>= tptp.c 1)))))) :rule all_simplify)
% 0.61/0.85  (step t613 (cl (= (=> (and (>= tptp.c 2) (not (>= tptp.c 1))) (and (not (>= tptp.c 1)) (>= tptp.c 2))) (not (and (>= tptp.c 2) (not (>= tptp.c 1)))))) :rule trans :premises (t611 t612))
% 0.61/0.85  (step t614 (cl (=> (and (>= tptp.c 2) (not (>= tptp.c 1))) (and (not (>= tptp.c 1)) (>= tptp.c 2))) (and (>= tptp.c 2) (not (>= tptp.c 1)))) :rule implies_neg1)
% 0.61/0.85  (anchor :step t615)
% 0.61/0.85  (assume t615.a0 (>= tptp.c 2))
% 0.61/0.85  (assume t615.a1 (not (>= tptp.c 1)))
% 0.61/0.85  (step t615.t1 (cl (and (not (>= tptp.c 1)) (>= tptp.c 2)) (not (not (>= tptp.c 1))) (not (>= tptp.c 2))) :rule and_neg)
% 0.61/0.85  (step t615.t2 (cl (and (not (>= tptp.c 1)) (>= tptp.c 2))) :rule resolution :premises (t615.t1 t615.a1 t615.a0))
% 0.61/0.85  (step t615 (cl (not (>= tptp.c 2)) (not (not (>= tptp.c 1))) (and (not (>= tptp.c 1)) (>= tptp.c 2))) :rule subproof :discharge (t615.a0 t615.a1))
% 0.61/0.85  (step t616 (cl (not (and (>= tptp.c 2) (not (>= tptp.c 1)))) (>= tptp.c 2)) :rule and_pos)
% 0.61/0.85  (step t617 (cl (not (and (>= tptp.c 2) (not (>= tptp.c 1)))) (not (>= tptp.c 1))) :rule and_pos)
% 0.61/0.85  (step t618 (cl (and (not (>= tptp.c 1)) (>= tptp.c 2)) (not (and (>= tptp.c 2) (not (>= tptp.c 1)))) (not (and (>= tptp.c 2) (not (>= tptp.c 1))))) :rule resolution :premises (t615 t616 t617))
% 0.61/0.85  (step t619 (cl (not (and (>= tptp.c 2) (not (>= tptp.c 1)))) (not (and (>= tptp.c 2) (not (>= tptp.c 1)))) (and (not (>= tptp.c 1)) (>= tptp.c 2))) :rule reordering :premises (t618))
% 0.61/0.85  (step t620 (cl (not (and (>= tptp.c 2) (not (>= tptp.c 1)))) (and (not (>= tptp.c 1)) (>= tptp.c 2))) :rule contraction :premises (t619))
% 0.61/0.85  (step t621 (cl (=> (and (>= tptp.c 2) (not (>= tptp.c 1))) (and (not (>= tptp.c 1)) (>= tptp.c 2))) (and (not (>= tptp.c 1)) (>= tptp.c 2))) :rule resolution :premises (t614 t620))
% 0.61/0.85  (step t622 (cl (=> (and (>= tptp.c 2) (not (>= tptp.c 1))) (and (not (>= tptp.c 1)) (>= tptp.c 2))) (not (and (not (>= tptp.c 1)) (>= tptp.c 2)))) :rule implies_neg2)
% 0.61/0.85  (step t623 (cl (=> (and (>= tptp.c 2) (not (>= tptp.c 1))) (and (not (>= tptp.c 1)) (>= tptp.c 2))) (=> (and (>= tptp.c 2) (not (>= tptp.c 1))) (and (not (>= tptp.c 1)) (>= tptp.c 2)))) :rule resolution :premises (t621 t622))
% 0.61/0.85  (step t624 (cl (=> (and (>= tptp.c 2) (not (>= tptp.c 1))) (and (not (>= tptp.c 1)) (>= tptp.c 2)))) :rule contraction :premises (t623))
% 0.61/0.85  (step t625 (cl (not (and (>= tptp.c 2) (not (>= tptp.c 1))))) :rule resolution :premises (t590 t613 t624))
% 0.61/0.85  (step t626 (cl (not (>= tptp.c 2)) (not (not (>= tptp.c 1)))) :rule not_and :premises (t625))
% 0.61/0.85  (step t627 (cl (or (not (>= tptp.c 2)) (not (not (>= tptp.c 1)))) (not (not (>= tptp.c 2)))) :rule or_neg)
% 0.61/0.85  (step t628 (cl (or (not (>= tptp.c 2)) (not (not (>= tptp.c 1)))) (not (not (not (>= tptp.c 1))))) :rule or_neg)
% 0.61/0.85  (step t629 (cl (or (not (>= tptp.c 2)) (not (not (>= tptp.c 1)))) (or (not (>= tptp.c 2)) (not (not (>= tptp.c 1))))) :rule resolution :premises (t626 t627 t628))
% 0.61/0.85  (step t630 (cl (or (not (>= tptp.c 2)) (not (not (>= tptp.c 1))))) :rule contraction :premises (t629))
% 0.61/0.85  (step t631 (cl (or (not (>= tptp.c 2)) (>= tptp.c 1))) :rule resolution :premises (t578 t589 t630))
% 0.61/0.85  (step t632 (cl (not (>= tptp.c 2)) (>= tptp.c 1)) :rule or :premises (t631))
% 0.61/0.85  (step t633 (cl (>= tptp.c 1)) :rule resolution :premises (t632 t195))
% 0.61/0.85  (step t634 (cl (not (= (=> (and (> tptp.d 0) (> tptp.c (* (- 1) (- 11)))) (> (* tptp.d tptp.c) (* tptp.d (* (- 1) (- 11))))) (=> (and (>= tptp.d 1) (>= tptp.c 12)) (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0))))) (not (=> (and (> tptp.d 0) (> tptp.c (* (- 1) (- 11)))) (> (* tptp.d tptp.c) (* tptp.d (* (- 1) (- 11)))))) (=> (and (>= tptp.d 1) (>= tptp.c 12)) (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)))) :rule equiv_pos2)
% 0.61/0.85  (step t635 (cl (= (> tptp.c (* (- 1) (- 11))) (not (<= tptp.c (* (- 1) (- 11)))))) :rule all_simplify)
% 0.61/0.85  (step t636 (cl (= (* (- 1) (- 11)) 11)) :rule all_simplify)
% 0.61/0.85  (step t637 (cl (= (<= tptp.c (* (- 1) (- 11))) (<= tptp.c 11))) :rule cong :premises (t135 t636))
% 0.61/0.85  (step t638 (cl (= (<= tptp.c 11) (not (>= tptp.c 12)))) :rule all_simplify)
% 0.61/0.85  (step t639 (cl (= (<= tptp.c (* (- 1) (- 11))) (not (>= tptp.c 12)))) :rule trans :premises (t637 t638))
% 0.61/0.85  (step t640 (cl (= (not (<= tptp.c (* (- 1) (- 11)))) (not (not (>= tptp.c 12))))) :rule cong :premises (t639))
% 0.61/0.85  (step t641 (cl (= (not (not (>= tptp.c 12))) (>= tptp.c 12))) :rule all_simplify)
% 0.61/0.85  (step t642 (cl (= (not (<= tptp.c (* (- 1) (- 11)))) (>= tptp.c 12))) :rule trans :premises (t640 t641))
% 0.61/0.85  (step t643 (cl (= (> tptp.c (* (- 1) (- 11))) (>= tptp.c 12))) :rule trans :premises (t635 t642))
% 0.61/0.85  (step t644 (cl (= (and (> tptp.d 0) (> tptp.c (* (- 1) (- 11)))) (and (>= tptp.d 1) (>= tptp.c 12)))) :rule cong :premises (t209 t643))
% 0.61/0.85  (step t645 (cl (= (> (* tptp.d tptp.c) (* tptp.d (* (- 1) (- 11)))) (not (<= (* tptp.d tptp.c) (* tptp.d (* (- 1) (- 11))))))) :rule all_simplify)
% 0.61/0.85  (step t646 (cl (= (* tptp.d (* (- 1) (- 11))) (* tptp.d 11))) :rule cong :premises (t126 t636))
% 0.61/0.85  (step t647 (cl (= (* tptp.d 11) (* 11 tptp.d))) :rule all_simplify)
% 0.61/0.85  (step t648 (cl (= (* tptp.d (* (- 1) (- 11))) (* 11 tptp.d))) :rule trans :premises (t646 t647))
% 0.61/0.85  (step t649 (cl (= (<= (* tptp.d tptp.c) (* tptp.d (* (- 1) (- 11)))) (<= (* tptp.d tptp.c) (* 11 tptp.d)))) :rule cong :premises (t212 t648))
% 0.61/0.85  (step t650 (cl (= (<= (* tptp.d tptp.c) (* 11 tptp.d)) (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0))) :rule all_simplify)
% 0.61/0.85  (step t651 (cl (= (<= (* tptp.d tptp.c) (* tptp.d (* (- 1) (- 11)))) (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0))) :rule trans :premises (t649 t650))
% 0.61/0.85  (step t652 (cl (= (not (<= (* tptp.d tptp.c) (* tptp.d (* (- 1) (- 11))))) (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)))) :rule cong :premises (t651))
% 0.61/0.85  (step t653 (cl (= (> (* tptp.d tptp.c) (* tptp.d (* (- 1) (- 11)))) (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)))) :rule trans :premises (t645 t652))
% 0.61/0.85  (step t654 (cl (= (=> (and (> tptp.d 0) (> tptp.c (* (- 1) (- 11)))) (> (* tptp.d tptp.c) (* tptp.d (* (- 1) (- 11))))) (=> (and (>= tptp.d 1) (>= tptp.c 12)) (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0))))) :rule cong :premises (t644 t653))
% 0.61/0.85  (step t655 (cl (=> (and (> tptp.d 0) (> tptp.c (* (- 1) (- 11)))) (> (* tptp.d tptp.c) (* tptp.d (* (- 1) (- 11)))))) :rule la_mult_pos)
% 0.61/0.85  (step t656 (cl (=> (and (>= tptp.d 1) (>= tptp.c 12)) (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)))) :rule resolution :premises (t634 t654 t655))
% 0.61/0.85  (step t657 (cl (not (and (>= tptp.d 1) (>= tptp.c 12))) (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0))) :rule implies :premises (t656))
% 0.61/0.85  (step t658 (cl (not (>= (+ (* 11 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)) (not (and (>= tptp.d 1) (>= tptp.c 12)))) :rule reordering :premises (t657))
% 0.61/0.85  (step t659 (cl (and (>= tptp.d 1) (>= tptp.c 12)) (not (>= tptp.d 1)) (not (>= tptp.c 12))) :rule and_neg)
% 0.61/0.85  (step t660 (cl (not (>= tptp.d 1)) (not (>= tptp.c 12)) (and (>= tptp.d 1) (>= tptp.c 12))) :rule reordering :premises (t659))
% 0.61/0.85  (step t661 (cl (not (= (or (= tptp.c 11) (or (not (>= tptp.c 11)) (>= tptp.c 12))) (or (= tptp.c 11) (not (>= tptp.c 11)) (>= tptp.c 12)))) (not (or (= tptp.c 11) (or (not (>= tptp.c 11)) (>= tptp.c 12)))) (or (= tptp.c 11) (not (>= tptp.c 11)) (>= tptp.c 12))) :rule equiv_pos2)
% 0.61/0.85  (step t662 (cl (= (or (= tptp.c 11) (or (not (>= tptp.c 11)) (>= tptp.c 12))) (or (= tptp.c 11) (not (>= tptp.c 11)) (>= tptp.c 12)))) :rule all_simplify)
% 0.61/0.85  (step t663 (cl (not (= (or (not (not (= tptp.c 11))) (not (not (< tptp.c 11))) (not (not (> tptp.c 11)))) (or (= tptp.c 11) (or (not (>= tptp.c 11)) (>= tptp.c 12))))) (not (or (not (not (= tptp.c 11))) (not (not (< tptp.c 11))) (not (not (> tptp.c 11))))) (or (= tptp.c 11) (or (not (>= tptp.c 11)) (>= tptp.c 12)))) :rule equiv_pos2)
% 0.61/0.85  (step t664 (cl (= (not (not (= tptp.c 11))) (= tptp.c 11))) :rule all_simplify)
% 0.61/0.85  (step t665 (cl (= (not (not (< tptp.c 11))) (< tptp.c 11))) :rule all_simplify)
% 0.61/0.85  (step t666 (cl (= (< tptp.c 11) (not (>= tptp.c 11)))) :rule all_simplify)
% 0.61/0.85  (step t667 (cl (= (not (not (< tptp.c 11))) (not (>= tptp.c 11)))) :rule trans :premises (t665 t666))
% 0.61/0.85  (step t668 (cl (= (not (not (> tptp.c 11))) (> tptp.c 11))) :rule all_simplify)
% 0.61/0.85  (step t669 (cl (= (> tptp.c 11) (not (<= tptp.c 11)))) :rule all_simplify)
% 0.61/0.85  (step t670 (cl (= (not (<= tptp.c 11)) (not (not (>= tptp.c 12))))) :rule cong :premises (t638))
% 0.61/0.85  (step t671 (cl (= (not (<= tptp.c 11)) (>= tptp.c 12))) :rule trans :premises (t670 t641))
% 0.61/0.85  (step t672 (cl (= (> tptp.c 11) (>= tptp.c 12))) :rule trans :premises (t669 t671))
% 0.61/0.85  (step t673 (cl (= (not (not (> tptp.c 11))) (>= tptp.c 12))) :rule trans :premises (t668 t672))
% 0.61/0.85  (step t674 (cl (= (or (not (not (= tptp.c 11))) (not (not (< tptp.c 11))) (not (not (> tptp.c 11)))) (or (= tptp.c 11) (not (>= tptp.c 11)) (>= tptp.c 12)))) :rule cong :premises (t664 t667 t673))
% 0.61/0.85  (step t675 (cl (= (or (= tptp.c 11) (or (not (>= tptp.c 11)) (>= tptp.c 12))) (or (= tptp.c 11) (not (>= tptp.c 11)) (>= tptp.c 12)))) :rule all_simplify)
% 0.61/0.85  (step t676 (cl (= (or (= tptp.c 11) (not (>= tptp.c 11)) (>= tptp.c 12)) (or (= tptp.c 11) (or (not (>= tptp.c 11)) (>= tptp.c 12))))) :rule symm :premises (t675))
% 0.61/0.85  (step t677 (cl (= (or (not (not (= tptp.c 11))) (not (not (< tptp.c 11))) (not (not (> tptp.c 11)))) (or (= tptp.c 11) (or (not (>= tptp.c 11)) (>= tptp.c 12))))) :rule trans :premises (t674 t676))
% 0.61/0.85  (step t678 (cl (=> (and (not (= tptp.c 11)) (not (< tptp.c 11)) (not (> tptp.c 11))) false) (and (not (= tptp.c 11)) (not (< tptp.c 11)) (not (> tptp.c 11)))) :rule implies_neg1)
% 0.61/0.85  (anchor :step t679)
% 0.61/0.85  (assume t679.a0 (not (= tptp.c 11)))
% 0.61/0.85  (assume t679.a1 (not (< tptp.c 11)))
% 0.61/0.85  (assume t679.a2 (not (> tptp.c 11)))
% 0.61/0.85  (step t679.t1 (cl (or (= tptp.c 11) (not (<= tptp.c 11)) (not (<= 11 tptp.c)))) :rule la_disequality)
% 0.61/0.85  (step t679.t2 (cl (= tptp.c 11) (not (<= tptp.c 11)) (not (<= 11 tptp.c))) :rule or :premises (t679.t1))
% 0.61/0.85  (step t679.t3 (cl (not (= (>= tptp.c 11) (<= 11 tptp.c))) (not (>= tptp.c 11)) (<= 11 tptp.c)) :rule equiv_pos2)
% 0.61/0.85  (step t679.t4 (cl (= (>= tptp.c 11) (<= 11 tptp.c))) :rule comp_simplify)
% 0.61/0.85  (step t679.t5 (cl (<= 11 tptp.c)) :rule resolution :premises (t679.t3 t679.t4 t679.a0))
% 0.61/0.85  (step t679.t6 (cl (not (<= tptp.c 11))) :rule resolution :premises (t679.t2 t679.t5 t679.a1))
% 0.61/0.85  (step t679.t7 (cl (not (= (> tptp.c 11) (not (<= tptp.c 11)))) (> tptp.c 11) (not (not (<= tptp.c 11)))) :rule equiv_pos1)
% 0.61/0.85  (step t679.t8 (cl (= (> tptp.c 11) (not (<= tptp.c 11)))) :rule comp_simplify)
% 0.61/0.85  (step t679.t9 (cl (> tptp.c 11)) :rule resolution :premises (t679.t6 t679.t7 t679.t8))
% 0.61/0.85  (step t679.t10 (cl) :rule resolution :premises (t679.t9 t679.a2))
% 0.61/0.85  (step t679 (cl (not (not (= tptp.c 11))) (not (not (< tptp.c 11))) (not (not (> tptp.c 11))) false) :rule subproof :discharge (t679.a0 t679.a1 t679.a2))
% 0.61/0.85  (step t680 (cl (not (and (not (= tptp.c 11)) (not (< tptp.c 11)) (not (> tptp.c 11)))) (not (= tptp.c 11))) :rule and_pos)
% 0.61/0.85  (step t681 (cl (not (and (not (= tptp.c 11)) (not (< tptp.c 11)) (not (> tptp.c 11)))) (not (< tptp.c 11))) :rule and_pos)
% 0.61/0.85  (step t682 (cl (not (and (not (= tptp.c 11)) (not (< tptp.c 11)) (not (> tptp.c 11)))) (not (> tptp.c 11))) :rule and_pos)
% 0.61/0.85  (step t683 (cl false (not (and (not (= tptp.c 11)) (not (< tptp.c 11)) (not (> tptp.c 11)))) (not (and (not (= tptp.c 11)) (not (< tptp.c 11)) (not (> tptp.c 11)))) (not (and (not (= tptp.c 11)) (not (< tptp.c 11)) (not (> tptp.c 11))))) :rule resolution :premises (t679 t680 t681 t682))
% 0.61/0.85  (step t684 (cl (not (and (not (= tptp.c 11)) (not (< tptp.c 11)) (not (> tptp.c 11)))) (not (and (not (= tptp.c 11)) (not (< tptp.c 11)) (not (> tptp.c 11)))) (not (and (not (= tptp.c 11)) (not (< tptp.c 11)) (not (> tptp.c 11)))) false) :rule reordering :premises (t683))
% 0.61/0.85  (step t685 (cl (not (and (not (= tptp.c 11)) (not (< tptp.c 11)) (not (> tptp.c 11)))) false) :rule contraction :premises (t684))
% 0.61/0.85  (step t686 (cl (=> (and (not (= tptp.c 11)) (not (< tptp.c 11)) (not (> tptp.c 11))) false) false) :rule resolution :premises (t678 t685))
% 0.61/0.85  (step t687 (cl (=> (and (not (= tptp.c 11)) (not (< tptp.c 11)) (not (> tptp.c 11))) false) (not false)) :rule implies_neg2)
% 0.61/0.85  (step t688 (cl (=> (and (not (= tptp.c 11)) (not (< tptp.c 11)) (not (> tptp.c 11))) false) (=> (and (not (= tptp.c 11)) (not (< tptp.c 11)) (not (> tptp.c 11))) false)) :rule resolution :premises (t686 t687))
% 0.61/0.85  (step t689 (cl (=> (and (not (= tptp.c 11)) (not (< tptp.c 11)) (not (> tptp.c 11))) false)) :rule contraction :premises (t688))
% 0.61/0.85  (step t690 (cl (= (=> (and (not (= tptp.c 11)) (not (< tptp.c 11)) (not (> tptp.c 11))) false) (not (and (not (= tptp.c 11)) (not (< tptp.c 11)) (not (> tptp.c 11)))))) :rule implies_simplify)
% 0.61/0.85  (step t691 (cl (not (=> (and (not (= tptp.c 11)) (not (< tptp.c 11)) (not (> tptp.c 11))) false)) (not (and (not (= tptp.c 11)) (not (< tptp.c 11)) (not (> tptp.c 11))))) :rule equiv1 :premises (t690))
% 0.61/0.85  (step t692 (cl (not (and (not (= tptp.c 11)) (not (< tptp.c 11)) (not (> tptp.c 11))))) :rule resolution :premises (t689 t691))
% 0.61/0.85  (step t693 (cl (not (not (= tptp.c 11))) (not (not (< tptp.c 11))) (not (not (> tptp.c 11)))) :rule not_and :premises (t692))
% 0.61/0.85  (step t694 (cl (or (not (not (= tptp.c 11))) (not (not (< tptp.c 11))) (not (not (> tptp.c 11)))) (not (not (not (= tptp.c 11))))) :rule or_neg)
% 0.61/0.85  (step t695 (cl (or (not (not (= tptp.c 11))) (not (not (< tptp.c 11))) (not (not (> tptp.c 11)))) (not (not (not (< tptp.c 11))))) :rule or_neg)
% 0.61/0.85  (step t696 (cl (or (not (not (= tptp.c 11))) (not (not (< tptp.c 11))) (not (not (> tptp.c 11)))) (not (not (not (> tptp.c 11))))) :rule or_neg)
% 0.61/0.85  (step t697 (cl (or (not (not (= tptp.c 11))) (not (not (< tptp.c 11))) (not (not (> tptp.c 11)))) (or (not (not (= tptp.c 11))) (not (not (< tptp.c 11))) (not (not (> tptp.c 11)))) (or (not (not (= tptp.c 11))) (not (not (< tptp.c 11))) (not (not (> tptp.c 11))))) :rule resolution :premises (t693 t694 t695 t696))
% 0.61/0.85  (step t698 (cl (or (not (not (= tptp.c 11))) (not (not (< tptp.c 11))) (not (not (> tptp.c 11))))) :rule contraction :premises (t697))
% 0.61/0.85  (step t699 (cl (or (= tptp.c 11) (or (not (>= tptp.c 11)) (>= tptp.c 12)))) :rule resolution :premises (t663 t677 t698))
% 0.61/0.85  (step t700 (cl (or (= tptp.c 11) (not (>= tptp.c 11)) (>= tptp.c 12))) :rule resolution :premises (t661 t662 t699))
% 0.61/0.85  (step t701 (cl (= tptp.c 11) (not (>= tptp.c 11)) (>= tptp.c 12)) :rule or :premises (t700))
% 0.61/0.85  (step t702 (cl (not (>= tptp.c 11)) (>= tptp.c 12) (= tptp.c 11)) :rule reordering :premises (t701))
% 0.61/0.85  (step t703 (cl (not (= (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) (not (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (not (>= tptp.c 11)))) (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1) (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1) (>= tptp.c 11)))) (not (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) (not (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (not (>= tptp.c 11))))) (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1) (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1) (>= tptp.c 11))) :rule equiv_pos2)
% 0.61/0.85  (step t704 (cl (= (= (= (not (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) true) (= (not (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)))) :rule equiv_simplify)
% 0.61/0.85  (step t705 (cl (not (= (= (not (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) true)) (= (not (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) :rule equiv1 :premises (t704))
% 0.61/0.85  (step t706 (cl (= (= (not (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (= (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1) (not (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)))))) :rule all_simplify)
% 0.61/0.85  (step t707 (cl (= (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1) (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) :rule refl)
% 0.61/0.85  (step t708 (cl (= (not (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) :rule all_simplify)
% 0.61/0.85  (step t709 (cl (= (= (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1) (not (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)))) (= (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1) (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)))) :rule cong :premises (t707 t708))
% 0.61/0.85  (step t710 (cl (= (= (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1) (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) true)) :rule all_simplify)
% 0.61/0.85  (step t711 (cl (= (= (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1) (not (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)))) true)) :rule trans :premises (t709 t710))
% 0.61/0.85  (step t712 (cl (= (= (not (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) true)) :rule trans :premises (t706 t711))
% 0.61/0.85  (step t713 (cl (= (not (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) :rule resolution :premises (t705 t712))
% 0.61/0.85  (step t714 (cl (= (= (= (not (not (>= tptp.c 11))) (>= tptp.c 11)) true) (= (not (not (>= tptp.c 11))) (>= tptp.c 11)))) :rule equiv_simplify)
% 0.61/0.85  (step t715 (cl (not (= (= (not (not (>= tptp.c 11))) (>= tptp.c 11)) true)) (= (not (not (>= tptp.c 11))) (>= tptp.c 11))) :rule equiv1 :premises (t714))
% 0.61/0.85  (step t716 (cl (= (= (not (not (>= tptp.c 11))) (>= tptp.c 11)) (= (>= tptp.c 11) (not (not (>= tptp.c 11)))))) :rule all_simplify)
% 0.61/0.85  (step t717 (cl (= (>= tptp.c 11) (>= tptp.c 11))) :rule refl)
% 0.61/0.85  (step t718 (cl (= (not (not (>= tptp.c 11))) (>= tptp.c 11))) :rule all_simplify)
% 0.61/0.85  (step t719 (cl (= (= (>= tptp.c 11) (not (not (>= tptp.c 11)))) (= (>= tptp.c 11) (>= tptp.c 11)))) :rule cong :premises (t717 t718))
% 0.61/0.85  (step t720 (cl (= (= (>= tptp.c 11) (>= tptp.c 11)) true)) :rule all_simplify)
% 0.61/0.85  (step t721 (cl (= (= (>= tptp.c 11) (not (not (>= tptp.c 11)))) true)) :rule trans :premises (t719 t720))
% 0.61/0.85  (step t722 (cl (= (= (not (not (>= tptp.c 11))) (>= tptp.c 11)) true)) :rule trans :premises (t716 t721))
% 0.61/0.85  (step t723 (cl (= (not (not (>= tptp.c 11))) (>= tptp.c 11))) :rule resolution :premises (t715 t722))
% 0.61/0.85  (step t724 (cl (= (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) (not (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (not (>= tptp.c 11)))) (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1) (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1) (>= tptp.c 11)))) :rule cong :premises (t46 t713 t517 t723))
% 0.61/0.85  (step t725 (cl (not (= (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11))) (and (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11)))))) (not (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11))) (and (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11))))) :rule equiv_pos2)
% 0.61/0.85  (step t726 (cl (= (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11))) (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11))))) :rule refl)
% 0.61/0.85  (step t727 (cl (= (= (and (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) false) (not (and (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))))) :rule equiv_simplify)
% 0.61/0.85  (step t728 (cl (= (and (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) false) (not (not (and (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))))) :rule equiv2 :premises (t727))
% 0.61/0.85  (step t729 (cl (not (not (not (and (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))))) (and (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule not_not)
% 0.61/0.85  (step t730 (cl (= (and (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) false) (and (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule resolution :premises (t728 t729))
% 0.61/0.85  (step t731 (cl (=> (and (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) false) (and (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule implies_neg1)
% 0.61/0.85  (anchor :step t732)
% 0.61/0.85  (assume t732.a0 (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)))
% 0.61/0.85  (assume t732.a1 (not (>= tptp.c 11)))
% 0.61/0.85  (assume t732.a2 (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)))
% 0.61/0.85  (assume t732.a3 (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))
% 0.61/0.85  (step t732.t1 (cl (not (= (< (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)))) (not (< (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule equiv_pos2)
% 0.61/0.85  (step t732.t2 (cl (= (< (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)))) :rule all_simplify)
% 0.61/0.85  (step t732.t3 (cl (not (= (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (< (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (not (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (< (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) :rule equiv_pos2)
% 0.61/0.85  (step t732.t4 (cl (= (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (< (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule symm :premises (t732.t2))
% 0.61/0.85  (step t732.t5 (cl (=> (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) false) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) :rule implies_neg1)
% 0.61/0.85  (anchor :step t732.t6)
% 0.61/0.85  (assume t732.t6.a0 (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))
% 0.61/0.85  (step t732.t6.t1 (cl (not (= (< (+ (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ 1 3) (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ 2 3) tptp.c) (* (/ 2 3) (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))))) (+ (* (- 1.0) 7) (* (/ 1 3) 1) (* (/ 2 3) 10) (* (/ 2 3) 0))) false)) (not (< (+ (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ 1 3) (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ 2 3) tptp.c) (* (/ 2 3) (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))))) (+ (* (- 1.0) 7) (* (/ 1 3) 1) (* (/ 2 3) 10) (* (/ 2 3) 0)))) false) :rule equiv_pos2)
% 0.61/0.85  (step t732.t6.t2 (cl (= (< (+ (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ 1 3) (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ 2 3) tptp.c) (* (/ 2 3) (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))))) (+ (* (- 1.0) 7) (* (/ 1 3) 1) (* (/ 2 3) 10) (* (/ 2 3) 0))) (not (>= (+ (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ 1 3) (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ 2 3) tptp.c) (* (/ 2 3) (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))))) (+ (* (- 1.0) 7) (* (/ 1 3) 1) (* (/ 2 3) 10) (* (/ 2 3) 0)))))) :rule all_simplify)
% 0.61/0.85  (step t732.t6.t3 (cl (= (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (to_real (+ (* (- 2) tptp.d) (* (- 3) tptp.c) (* tptp.d tptp.c))))) :rule all_simplify)
% 0.61/0.85  (step t732.t6.t4 (cl (= (* (/ 1 3) (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (+ (* (/ 7 3) tptp.c) (* (/ (- 1) 3) (* tptp.d tptp.c))))) :rule all_simplify)
% 0.61/0.85  (step t732.t6.t5 (cl (= (* (/ 2 3) tptp.c) (* (/ 2 3) tptp.c))) :rule refl)
% 0.61/0.85  (step t732.t6.t6 (cl (= (* (/ 2 3) (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c)))) (+ (* 2 tptp.d) (* (/ (- 2) 3) (* tptp.d tptp.c))))) :rule all_simplify)
% 0.61/0.85  (step t732.t6.t7 (cl (= (+ (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ 1 3) (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ 2 3) tptp.c) (* (/ 2 3) (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))))) (+ (to_real (+ (* (- 2) tptp.d) (* (- 3) tptp.c) (* tptp.d tptp.c))) (+ (* (/ 7 3) tptp.c) (* (/ (- 1) 3) (* tptp.d tptp.c))) (* (/ 2 3) tptp.c) (+ (* 2 tptp.d) (* (/ (- 2) 3) (* tptp.d tptp.c)))))) :rule cong :premises (t732.t6.t3 t732.t6.t4 t732.t6.t5 t732.t6.t6))
% 0.61/0.85  (step t732.t6.t8 (cl (= (+ (to_real (+ (* (- 2) tptp.d) (* (- 3) tptp.c) (* tptp.d tptp.c))) (+ (* (/ 7 3) tptp.c) (* (/ (- 1) 3) (* tptp.d tptp.c))) (* (/ 2 3) tptp.c) (+ (* 2 tptp.d) (* (/ (- 2) 3) (* tptp.d tptp.c)))) 0.0)) :rule all_simplify)
% 0.61/0.85  (step t732.t6.t9 (cl (= (+ (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ 1 3) (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ 2 3) tptp.c) (* (/ 2 3) (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))))) 0.0)) :rule trans :premises (t732.t6.t7 t732.t6.t8))
% 0.61/0.85  (step t732.t6.t10 (cl (= (* (- 1.0) 7) (- 7.0))) :rule all_simplify)
% 0.61/0.85  (step t732.t6.t11 (cl (= (* (/ 1 3) 1) (/ 1 3))) :rule all_simplify)
% 0.61/0.85  (step t732.t6.t12 (cl (= (* (/ 2 3) 10) (/ 20 3))) :rule all_simplify)
% 0.61/0.85  (step t732.t6.t13 (cl (= (* (/ 2 3) 0) 0.0)) :rule all_simplify)
% 0.61/0.85  (step t732.t6.t14 (cl (= (+ (* (- 1.0) 7) (* (/ 1 3) 1) (* (/ 2 3) 10) (* (/ 2 3) 0)) (+ (- 7.0) (/ 1 3) (/ 20 3) 0.0))) :rule cong :premises (t732.t6.t10 t732.t6.t11 t732.t6.t12 t732.t6.t13))
% 0.61/0.85  (step t732.t6.t15 (cl (= (+ (- 7.0) (/ 1 3) (/ 20 3) 0.0) 0.0)) :rule all_simplify)
% 0.61/0.85  (step t732.t6.t16 (cl (= (+ (* (- 1.0) 7) (* (/ 1 3) 1) (* (/ 2 3) 10) (* (/ 2 3) 0)) 0.0)) :rule trans :premises (t732.t6.t14 t732.t6.t15))
% 0.61/0.85  (step t732.t6.t17 (cl (= (>= (+ (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ 1 3) (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ 2 3) tptp.c) (* (/ 2 3) (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))))) (+ (* (- 1.0) 7) (* (/ 1 3) 1) (* (/ 2 3) 10) (* (/ 2 3) 0))) (>= 0.0 0.0))) :rule cong :premises (t732.t6.t9 t732.t6.t16))
% 0.61/0.85  (step t732.t6.t18 (cl (= (>= 0.0 0.0) true)) :rule all_simplify)
% 0.61/0.85  (step t732.t6.t19 (cl (= (>= (+ (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ 1 3) (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ 2 3) tptp.c) (* (/ 2 3) (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))))) (+ (* (- 1.0) 7) (* (/ 1 3) 1) (* (/ 2 3) 10) (* (/ 2 3) 0))) true)) :rule trans :premises (t732.t6.t17 t732.t6.t18))
% 0.61/0.85  (step t732.t6.t20 (cl (= (not (>= (+ (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ 1 3) (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ 2 3) tptp.c) (* (/ 2 3) (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))))) (+ (* (- 1.0) 7) (* (/ 1 3) 1) (* (/ 2 3) 10) (* (/ 2 3) 0)))) (not true))) :rule cong :premises (t732.t6.t19))
% 0.61/0.85  (step t732.t6.t21 (cl (= (not true) false)) :rule all_simplify)
% 0.61/0.85  (step t732.t6.t22 (cl (= (not (>= (+ (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ 1 3) (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ 2 3) tptp.c) (* (/ 2 3) (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))))) (+ (* (- 1.0) 7) (* (/ 1 3) 1) (* (/ 2 3) 10) (* (/ 2 3) 0)))) false)) :rule trans :premises (t732.t6.t20 t732.t6.t21))
% 0.61/0.85  (step t732.t6.t23 (cl (= (< (+ (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ 1 3) (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ 2 3) tptp.c) (* (/ 2 3) (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))))) (+ (* (- 1.0) 7) (* (/ 1 3) 1) (* (/ 2 3) 10) (* (/ 2 3) 0))) false)) :rule trans :premises (t732.t6.t2 t732.t6.t22))
% 0.61/0.85  (step t732.t6.t24 (cl (not (<= (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) 7))) (not (< (* (/ 1 3) (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ 1 3) 1))) (not (<= (* (/ 2 3) tptp.c) (* (/ 2 3) 10))) (not (<= (* (/ 2 3) (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c)))) (* (/ 2 3) 0))) (< (+ (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ 1 3) (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ 2 3) tptp.c) (* (/ 2 3) (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))))) (+ (* (- 1.0) 7) (* (/ 1 3) 1) (* (/ 2 3) 10) (* (/ 2 3) 0)))) :rule la_generic :args (1 1 1 1 1))
% 0.61/0.85  (step t732.t6.t25 (cl (=> (and (< (- 1.0) 0) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (<= (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) 7)))) :rule la_mult_neg)
% 0.61/0.85  (step t732.t6.t26 (cl (not (and (< (- 1.0) 0) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (<= (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) 7))) :rule implies :premises (t732.t6.t25))
% 0.61/0.85  (step t732.t6.t27 (cl (and (< (- 1.0) 0) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (< (- 1.0) 0)) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule and_neg)
% 0.61/0.85  (step t732.t6.t28 (cl (= (= (< (- 1.0) 0) true) (< (- 1.0) 0))) :rule equiv_simplify)
% 0.61/0.85  (step t732.t6.t29 (cl (not (= (< (- 1.0) 0) true)) (< (- 1.0) 0)) :rule equiv1 :premises (t732.t6.t28))
% 0.61/0.85  (step t732.t6.t30 (cl (= (< (- 1.0) 0) true)) :rule hole :args ((< (- 1.0) 0)))
% 0.61/0.85  (step t732.t6.t31 (cl (< (- 1.0) 0)) :rule resolution :premises (t732.t6.t29 t732.t6.t30))
% 0.61/0.85  (step t732.t6.t32 (cl (and (< (- 1.0) 0) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule resolution :premises (t732.t6.t27 t732.t6.t31 t732.t6.a0))
% 0.61/0.85  (step t732.t6.t33 (cl (<= (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) 7))) :rule resolution :premises (t732.t6.t26 t732.t6.t32))
% 0.61/0.85  (step t732.t6.t34 (cl (=> (and (> (/ 1 3) 0) (< (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (< (* (/ 1 3) (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ 1 3) 1)))) :rule la_mult_pos)
% 0.61/0.85  (step t732.t6.t35 (cl (not (and (> (/ 1 3) 0) (< (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (< (* (/ 1 3) (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ 1 3) 1))) :rule implies :premises (t732.t6.t34))
% 0.61/0.85  (step t732.t6.t36 (cl (and (> (/ 1 3) 0) (< (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (> (/ 1 3) 0)) (not (< (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) :rule and_neg)
% 0.61/0.85  (step t732.t6.t37 (cl (= (= (> (/ 1 3) 0) true) (> (/ 1 3) 0))) :rule equiv_simplify)
% 0.61/0.85  (step t732.t6.t38 (cl (not (= (> (/ 1 3) 0) true)) (> (/ 1 3) 0)) :rule equiv1 :premises (t732.t6.t37))
% 0.61/0.85  (step t732.t6.t39 (cl (= (> (/ 1 3) 0) true)) :rule hole :args ((> (/ 1 3) 0)))
% 0.61/0.85  (step t732.t6.t40 (cl (> (/ 1 3) 0)) :rule resolution :premises (t732.t6.t38 t732.t6.t39))
% 0.61/0.85  (step t732.t6.t41 (cl (not (= (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (< (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (< (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) :rule equiv_pos2)
% 0.61/0.85  (step t732.t6.t42 (cl (= (< (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)))) :rule all_simplify)
% 0.61/0.85  (step t732.t6.t43 (cl (= (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (< (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) :rule symm :premises (t732.t6.t42))
% 0.61/0.85  (step t732.t6.t44 (cl (< (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) :rule resolution :premises (t732.t6.t41 t732.t6.t43 t732.a2))
% 0.61/0.85  (step t732.t6.t45 (cl (and (> (/ 1 3) 0) (< (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) :rule resolution :premises (t732.t6.t36 t732.t6.t40 t732.t6.t44))
% 0.61/0.85  (step t732.t6.t46 (cl (< (* (/ 1 3) (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ 1 3) 1))) :rule resolution :premises (t732.t6.t35 t732.t6.t45))
% 0.61/0.85  (step t732.t6.t47 (cl (=> (and (> (/ 2 3) 0) (<= tptp.c 10)) (<= (* (/ 2 3) tptp.c) (* (/ 2 3) 10)))) :rule la_mult_pos)
% 0.61/0.85  (step t732.t6.t48 (cl (not (and (> (/ 2 3) 0) (<= tptp.c 10))) (<= (* (/ 2 3) tptp.c) (* (/ 2 3) 10))) :rule implies :premises (t732.t6.t47))
% 0.61/0.85  (step t732.t6.t49 (cl (and (> (/ 2 3) 0) (<= tptp.c 10)) (not (> (/ 2 3) 0)) (not (<= tptp.c 10))) :rule and_neg)
% 0.61/0.85  (step t732.t6.t50 (cl (= (= (> (/ 2 3) 0) true) (> (/ 2 3) 0))) :rule equiv_simplify)
% 0.61/0.85  (step t732.t6.t51 (cl (not (= (> (/ 2 3) 0) true)) (> (/ 2 3) 0)) :rule equiv1 :premises (t732.t6.t50))
% 0.61/0.85  (step t732.t6.t52 (cl (= (> (/ 2 3) 0) true)) :rule hole :args ((> (/ 2 3) 0)))
% 0.61/0.85  (step t732.t6.t53 (cl (> (/ 2 3) 0)) :rule resolution :premises (t732.t6.t51 t732.t6.t52))
% 0.61/0.85  (step t732.t6.t54 (cl (not (< tptp.c 11)) (<= tptp.c 10)) :rule la_generic :args (1 1))
% 0.61/0.85  (step t732.t6.t55 (cl (not (= (not (>= tptp.c 11)) (< tptp.c 11))) (not (not (>= tptp.c 11))) (< tptp.c 11)) :rule equiv_pos2)
% 0.61/0.85  (step t732.t6.t56 (cl (= (not (>= tptp.c 11)) (< tptp.c 11))) :rule symm :premises (t666))
% 0.61/0.85  (step t732.t6.t57 (cl (< tptp.c 11)) :rule resolution :premises (t732.t6.t55 t732.t6.t56 t732.a1))
% 0.61/0.85  (step t732.t6.t58 (cl (<= tptp.c 10)) :rule resolution :premises (t732.t6.t54 t732.t6.t57))
% 0.61/0.85  (step t732.t6.t59 (cl (and (> (/ 2 3) 0) (<= tptp.c 10))) :rule resolution :premises (t732.t6.t49 t732.t6.t53 t732.t6.t58))
% 0.61/0.85  (step t732.t6.t60 (cl (<= (* (/ 2 3) tptp.c) (* (/ 2 3) 10))) :rule resolution :premises (t732.t6.t48 t732.t6.t59))
% 0.61/0.85  (step t732.t6.t61 (cl (=> (and (> (/ 2 3) 0) (<= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)) (<= (* (/ 2 3) (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c)))) (* (/ 2 3) 0)))) :rule la_mult_pos)
% 0.61/0.85  (step t732.t6.t62 (cl (not (and (> (/ 2 3) 0) (<= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0))) (<= (* (/ 2 3) (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c)))) (* (/ 2 3) 0))) :rule implies :premises (t732.t6.t61))
% 0.61/0.85  (step t732.t6.t63 (cl (and (> (/ 2 3) 0) (<= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)) (not (> (/ 2 3) 0)) (not (<= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0))) :rule and_neg)
% 0.61/0.85  (step t732.t6.t64 (cl (not (< (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (<= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)) :rule la_generic :args (1 1))
% 0.61/0.85  (step t732.t6.t65 (cl (not (= (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (< (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) (not (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) (< (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) :rule equiv_pos2)
% 0.61/0.85  (step t732.t6.t66 (cl (= (< (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)))) :rule all_simplify)
% 0.61/0.85  (step t732.t6.t67 (cl (= (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (< (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) :rule symm :premises (t732.t6.t66))
% 0.61/0.85  (step t732.t6.t68 (cl (< (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) :rule resolution :premises (t732.t6.t65 t732.t6.t67 t732.a0))
% 0.61/0.85  (step t732.t6.t69 (cl (<= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0)) :rule resolution :premises (t732.t6.t64 t732.t6.t68))
% 0.61/0.85  (step t732.t6.t70 (cl (and (> (/ 2 3) 0) (<= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 0))) :rule resolution :premises (t732.t6.t63 t732.t6.t53 t732.t6.t69))
% 0.61/0.85  (step t732.t6.t71 (cl (<= (* (/ 2 3) (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c)))) (* (/ 2 3) 0))) :rule resolution :premises (t732.t6.t62 t732.t6.t70))
% 0.61/0.85  (step t732.t6.t72 (cl (< (+ (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ 1 3) (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ 2 3) tptp.c) (* (/ 2 3) (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))))) (+ (* (- 1.0) 7) (* (/ 1 3) 1) (* (/ 2 3) 10) (* (/ 2 3) 0)))) :rule resolution :premises (t732.t6.t24 t732.t6.t33 t732.t6.t46 t732.t6.t60 t732.t6.t71))
% 0.61/0.85  (step t732.t6.t73 (cl false) :rule resolution :premises (t732.t6.t1 t732.t6.t23 t732.t6.t72))
% 0.61/0.85  (step t732.t6 (cl (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) false) :rule subproof :discharge (t732.t6.a0))
% 0.61/0.85  (step t732.t7 (cl (=> (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) false) false) :rule resolution :premises (t732.t5 t732.t6))
% 0.61/0.85  (step t732.t8 (cl (=> (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) false) (not false)) :rule implies_neg2)
% 0.61/0.85  (step t732.t9 (cl (=> (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) false) (=> (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) false)) :rule resolution :premises (t732.t7 t732.t8))
% 0.61/0.85  (step t732.t10 (cl (=> (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) false)) :rule contraction :premises (t732.t9))
% 0.61/0.85  (step t732.t11 (cl (= (=> (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) false) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)))) :rule implies_simplify)
% 0.61/0.85  (step t732.t12 (cl (not (=> (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) false)) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule equiv1 :premises (t732.t11))
% 0.61/0.85  (step t732.t13 (cl (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule resolution :premises (t732.t10 t732.t12))
% 0.61/0.85  (step t732.t14 (cl (< (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) :rule resolution :premises (t732.t3 t732.t4 t732.t13))
% 0.61/0.85  (step t732.t15 (cl (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule resolution :premises (t732.t1 t732.t2 t732.t14))
% 0.61/0.85  (step t732.t16 (cl) :rule resolution :premises (t732.a3 t732.t15))
% 0.61/0.85  (step t732 (cl (not (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) (not (not (>= tptp.c 11))) (not (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) false) :rule subproof :discharge (t732.a0 t732.a1 t732.a2 t732.a3))
% 0.61/0.85  (step t733 (cl (not (and (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) :rule and_pos)
% 0.61/0.85  (step t734 (cl (not (and (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (not (>= tptp.c 11))) :rule and_pos)
% 0.61/0.85  (step t735 (cl (not (and (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) :rule and_pos)
% 0.61/0.85  (step t736 (cl (not (and (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) :rule and_pos)
% 0.61/0.85  (step t737 (cl false (not (and (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (not (and (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (not (and (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (not (and (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)))) :rule resolution :premises (t732 t733 t734 t735 t736))
% 0.61/0.85  (step t738 (cl (not (and (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (not (and (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (not (and (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (not (and (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) false) :rule reordering :premises (t737))
% 0.61/0.85  (step t739 (cl (not (and (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) false) :rule contraction :premises (t738))
% 0.61/0.85  (step t740 (cl (=> (and (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) false) false) :rule resolution :premises (t731 t739))
% 0.61/0.85  (step t741 (cl (=> (and (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) false) (not false)) :rule implies_neg2)
% 0.61/0.85  (step t742 (cl (=> (and (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) false) (=> (and (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) false)) :rule resolution :premises (t740 t741))
% 0.61/0.85  (step t743 (cl (=> (and (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) false)) :rule contraction :premises (t742))
% 0.61/0.85  (step t744 (cl (= (=> (and (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) false) (not (and (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))))) :rule implies_simplify)
% 0.61/0.85  (step t745 (cl (not (=> (and (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) false)) (not (and (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)))) :rule equiv1 :premises (t744))
% 0.61/0.85  (step t746 (cl (not (and (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)))) :rule resolution :premises (t743 t745))
% 0.61/0.85  (step t747 (cl (= (and (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) false)) :rule resolution :premises (t730 t746))
% 0.61/0.85  (step t748 (cl (= (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11))) (and (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11))) false))) :rule cong :premises (t726 t747))
% 0.61/0.85  (step t749 (cl (= (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11))) false) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11)))))) :rule all_simplify)
% 0.61/0.85  (step t750 (cl (= (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11))) (and (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11)))))) :rule trans :premises (t748 t749))
% 0.61/0.85  (step t751 (cl (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11))) (and (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11)))) :rule implies_neg1)
% 0.61/0.85  (anchor :step t752)
% 0.61/0.85  (assume t752.a0 (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))
% 0.61/0.85  (assume t752.a1 (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)))
% 0.61/0.85  (assume t752.a2 (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)))
% 0.61/0.85  (assume t752.a3 (not (>= tptp.c 11)))
% 0.61/0.85  (step t752.t1 (cl (and (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) (not (not (>= tptp.c 11))) (not (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule and_neg)
% 0.61/0.85  (step t752.t2 (cl (and (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule resolution :premises (t752.t1 t752.a1 t752.a3 t752.a2 t752.a0))
% 0.61/0.85  (step t752 (cl (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) (not (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (not (>= tptp.c 11))) (and (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule subproof :discharge (t752.a0 t752.a1 t752.a2 t752.a3))
% 0.61/0.85  (step t753 (cl (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11)))) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) :rule and_pos)
% 0.61/0.85  (step t754 (cl (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11)))) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) :rule and_pos)
% 0.61/0.85  (step t755 (cl (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11)))) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) :rule and_pos)
% 0.61/0.85  (step t756 (cl (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11)))) (not (>= tptp.c 11))) :rule and_pos)
% 0.61/0.85  (step t757 (cl (and (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11)))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11)))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11)))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11))))) :rule resolution :premises (t752 t753 t754 t755 t756))
% 0.61/0.85  (step t758 (cl (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11)))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11)))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11)))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11)))) (and (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule reordering :premises (t757))
% 0.61/0.85  (step t759 (cl (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11)))) (and (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule contraction :premises (t758))
% 0.61/0.85  (step t760 (cl (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11))) (and (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (and (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule resolution :premises (t751 t759))
% 0.61/0.85  (step t761 (cl (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11))) (and (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (not (and (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)))) :rule implies_neg2)
% 0.61/0.85  (step t762 (cl (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11))) (and (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11))) (and (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)))) :rule resolution :premises (t760 t761))
% 0.61/0.85  (step t763 (cl (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11))) (and (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)))) :rule contraction :premises (t762))
% 0.61/0.85  (step t764 (cl (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.c 11))))) :rule resolution :premises (t725 t750 t763))
% 0.61/0.85  (step t765 (cl (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) (not (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (not (>= tptp.c 11)))) :rule not_and :premises (t764))
% 0.61/0.85  (step t766 (cl (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) (not (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (not (>= tptp.c 11)))) (not (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)))) :rule or_neg)
% 0.61/0.85  (step t767 (cl (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) (not (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (not (>= tptp.c 11)))) (not (not (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))))) :rule or_neg)
% 0.61/0.85  (step t768 (cl (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) (not (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (not (>= tptp.c 11)))) (not (not (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))))) :rule or_neg)
% 0.61/0.85  (step t769 (cl (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) (not (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (not (>= tptp.c 11)))) (not (not (not (>= tptp.c 11))))) :rule or_neg)
% 0.61/0.85  (step t770 (cl (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) (not (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (not (>= tptp.c 11)))) (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) (not (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (not (>= tptp.c 11)))) (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) (not (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (not (>= tptp.c 11)))) (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) (not (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (not (>= tptp.c 11))))) :rule resolution :premises (t765 t766 t767 t768 t769))
% 0.61/0.85  (step t771 (cl (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) (not (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (not (>= tptp.c 11))))) :rule contraction :premises (t770))
% 0.61/0.85  (step t772 (cl (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1) (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1) (>= tptp.c 11))) :rule resolution :premises (t703 t724 t771))
% 0.61/0.85  (step t773 (cl (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1) (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1) (>= tptp.c 11)) :rule or :premises (t772))
% 0.61/0.85  (step t774 (cl (not (= (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (= tptp.c 11)) (not (not (>= tptp.d 26)))) (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1) (not (= tptp.c 11)) (>= tptp.d 26)))) (not (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (= tptp.c 11)) (not (not (>= tptp.d 26))))) (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1) (not (= tptp.c 11)) (>= tptp.d 26))) :rule equiv_pos2)
% 0.61/0.85  (step t775 (cl (= (not (= tptp.c 11)) (not (= tptp.c 11)))) :rule refl)
% 0.61/0.85  (step t776 (cl (= (= (= (not (not (>= tptp.d 26))) (>= tptp.d 26)) true) (= (not (not (>= tptp.d 26))) (>= tptp.d 26)))) :rule equiv_simplify)
% 0.61/0.85  (step t777 (cl (not (= (= (not (not (>= tptp.d 26))) (>= tptp.d 26)) true)) (= (not (not (>= tptp.d 26))) (>= tptp.d 26))) :rule equiv1 :premises (t776))
% 0.61/0.85  (step t778 (cl (= (= (not (not (>= tptp.d 26))) (>= tptp.d 26)) (= (>= tptp.d 26) (not (not (>= tptp.d 26)))))) :rule all_simplify)
% 0.61/0.85  (step t779 (cl (= (>= tptp.d 26) (>= tptp.d 26))) :rule refl)
% 0.61/0.85  (step t780 (cl (= (not (not (>= tptp.d 26))) (>= tptp.d 26))) :rule all_simplify)
% 0.61/0.85  (step t781 (cl (= (= (>= tptp.d 26) (not (not (>= tptp.d 26)))) (= (>= tptp.d 26) (>= tptp.d 26)))) :rule cong :premises (t779 t780))
% 0.61/0.85  (step t782 (cl (= (= (>= tptp.d 26) (>= tptp.d 26)) true)) :rule all_simplify)
% 0.61/0.85  (step t783 (cl (= (= (>= tptp.d 26) (not (not (>= tptp.d 26)))) true)) :rule trans :premises (t781 t782))
% 0.61/0.85  (step t784 (cl (= (= (not (not (>= tptp.d 26))) (>= tptp.d 26)) true)) :rule trans :premises (t778 t783))
% 0.61/0.85  (step t785 (cl (= (not (not (>= tptp.d 26))) (>= tptp.d 26))) :rule resolution :premises (t777 t784))
% 0.61/0.85  (step t786 (cl (= (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (= tptp.c 11)) (not (not (>= tptp.d 26)))) (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1) (not (= tptp.c 11)) (>= tptp.d 26)))) :rule cong :premises (t46 t517 t775 t785))
% 0.61/0.85  (step t787 (cl (not (= (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 11) (not (>= tptp.d 26))) (and (not (>= tptp.d 26)) (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 11) (not (>= tptp.d 26)))))) (not (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 11) (not (>= tptp.d 26))) (and (not (>= tptp.d 26)) (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 11) (not (>= tptp.d 26))))) :rule equiv_pos2)
% 0.61/0.85  (step t788 (cl (= (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 11) (not (>= tptp.d 26))) (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 11) (not (>= tptp.d 26))))) :rule refl)
% 0.61/0.85  (step t789 (cl (= (= (and (not (>= tptp.d 26)) (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) false) (not (and (not (>= tptp.d 26)) (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)))))) :rule equiv_simplify)
% 0.61/0.85  (step t790 (cl (= (and (not (>= tptp.d 26)) (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) false) (not (not (and (not (>= tptp.d 26)) (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)))))) :rule equiv2 :premises (t789))
% 0.61/0.85  (step t791 (cl (not (not (not (and (not (>= tptp.d 26)) (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)))))) (and (not (>= tptp.d 26)) (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)))) :rule not_not)
% 0.61/0.85  (step t792 (cl (= (and (not (>= tptp.d 26)) (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) false) (and (not (>= tptp.d 26)) (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)))) :rule resolution :premises (t790 t791))
% 0.61/0.85  (step t793 (cl (=> (and (not (>= tptp.d 26)) (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) false) (and (not (>= tptp.d 26)) (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)))) :rule implies_neg1)
% 0.61/0.85  (anchor :step t794)
% 0.61/0.85  (assume t794.a0 (not (>= tptp.d 26)))
% 0.61/0.85  (assume t794.a1 (= tptp.c 11))
% 0.61/0.85  (assume t794.a2 (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))
% 0.61/0.85  (assume t794.a3 (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)))
% 0.61/0.85  (step t794.t1 (cl (not (= (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (< (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (< (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) :rule equiv_pos2)
% 0.61/0.85  (step t794.t2 (cl (= (< (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)))) :rule all_simplify)
% 0.61/0.85  (step t794.t3 (cl (= (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (< (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) :rule symm :premises (t794.t2))
% 0.61/0.85  (step t794.t4 (cl (< (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) :rule resolution :premises (t794.t1 t794.t3 t794.a3))
% 0.61/0.85  (step t794.t5 (cl (not (= (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1) (not (< (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)))) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (< (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) :rule equiv_pos2)
% 0.61/0.85  (step t794.t6 (cl (= (not (< (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))))) :rule cong :premises (t794.t2))
% 0.61/0.85  (step t794.t7 (cl (= (not (< (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) :rule trans :premises (t794.t6 t512))
% 0.61/0.85  (step t794.t8 (cl (= (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1) (not (< (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)))) :rule symm :premises (t794.t7))
% 0.61/0.85  (step t794.t9 (cl (not (= (not (< (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (not (< (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) :rule equiv_pos2)
% 0.61/0.85  (step t794.t10 (cl (=> (< (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1) false) (< (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) :rule implies_neg1)
% 0.61/0.85  (anchor :step t794.t11)
% 0.61/0.85  (assume t794.t11.a0 (< (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))
% 0.61/0.85  (step t794.t11.t1 (cl (not (= (< (+ (* 1.0 (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 4.0) tptp.c) (* 2.0 tptp.d)) (+ (* 1.0 1) (* (- 1.0) 7) (* (- 4.0) 11) (* 2.0 25))) false)) (not (< (+ (* 1.0 (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 4.0) tptp.c) (* 2.0 tptp.d)) (+ (* 1.0 1) (* (- 1.0) 7) (* (- 4.0) 11) (* 2.0 25)))) false) :rule equiv_pos2)
% 0.61/0.85  (step t794.t11.t2 (cl (= (< (+ (* 1.0 (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 4.0) tptp.c) (* 2.0 tptp.d)) (+ (* 1.0 1) (* (- 1.0) 7) (* (- 4.0) 11) (* 2.0 25))) (not (>= (+ (* 1.0 (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 4.0) tptp.c) (* 2.0 tptp.d)) (+ (* 1.0 1) (* (- 1.0) 7) (* (- 4.0) 11) (* 2.0 25)))))) :rule all_simplify)
% 0.61/0.85  (step t794.t11.t3 (cl (= (* 1.0 (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (to_real (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c)))))) :rule all_simplify)
% 0.61/0.85  (step t794.t11.t4 (cl (= (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (to_real (+ (* (- 2) tptp.d) (* (- 3) tptp.c) (* tptp.d tptp.c))))) :rule all_simplify)
% 0.61/0.85  (step t794.t11.t5 (cl (= (* (- 4.0) tptp.c) (to_real (* (- 4) tptp.c)))) :rule all_simplify)
% 0.61/0.85  (step t794.t11.t6 (cl (= (* 2.0 tptp.d) (to_real (* 2 tptp.d)))) :rule all_simplify)
% 0.61/0.85  (step t794.t11.t7 (cl (= (+ (* 1.0 (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 4.0) tptp.c) (* 2.0 tptp.d)) (+ (to_real (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (to_real (+ (* (- 2) tptp.d) (* (- 3) tptp.c) (* tptp.d tptp.c))) (to_real (* (- 4) tptp.c)) (to_real (* 2 tptp.d))))) :rule cong :premises (t794.t11.t3 t794.t11.t4 t794.t11.t5 t794.t11.t6))
% 0.61/0.85  (step t794.t11.t8 (cl (= (+ (to_real (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (to_real (+ (* (- 2) tptp.d) (* (- 3) tptp.c) (* tptp.d tptp.c))) (to_real (* (- 4) tptp.c)) (to_real (* 2 tptp.d))) 0.0)) :rule all_simplify)
% 0.61/0.85  (step t794.t11.t9 (cl (= (+ (* 1.0 (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 4.0) tptp.c) (* 2.0 tptp.d)) 0.0)) :rule trans :premises (t794.t11.t7 t794.t11.t8))
% 0.61/0.85  (step t794.t11.t10 (cl (= (* 1.0 1) 1.0)) :rule all_simplify)
% 0.61/0.85  (step t794.t11.t11 (cl (= (* (- 1.0) 7) (- 7.0))) :rule all_simplify)
% 0.61/0.85  (step t794.t11.t12 (cl (= (* (- 4.0) 11) (- 44.0))) :rule all_simplify)
% 0.61/0.85  (step t794.t11.t13 (cl (= (* 2.0 25) 50.0)) :rule all_simplify)
% 0.61/0.85  (step t794.t11.t14 (cl (= (+ (* 1.0 1) (* (- 1.0) 7) (* (- 4.0) 11) (* 2.0 25)) (+ 1.0 (- 7.0) (- 44.0) 50.0))) :rule cong :premises (t794.t11.t10 t794.t11.t11 t794.t11.t12 t794.t11.t13))
% 0.61/0.85  (step t794.t11.t15 (cl (= (+ 1.0 (- 7.0) (- 44.0) 50.0) 0.0)) :rule all_simplify)
% 0.61/0.85  (step t794.t11.t16 (cl (= (+ (* 1.0 1) (* (- 1.0) 7) (* (- 4.0) 11) (* 2.0 25)) 0.0)) :rule trans :premises (t794.t11.t14 t794.t11.t15))
% 0.61/0.85  (step t794.t11.t17 (cl (= (>= (+ (* 1.0 (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 4.0) tptp.c) (* 2.0 tptp.d)) (+ (* 1.0 1) (* (- 1.0) 7) (* (- 4.0) 11) (* 2.0 25))) (>= 0.0 0.0))) :rule cong :premises (t794.t11.t9 t794.t11.t16))
% 0.61/0.85  (step t794.t11.t18 (cl (= (>= 0.0 0.0) true)) :rule all_simplify)
% 0.61/0.85  (step t794.t11.t19 (cl (= (>= (+ (* 1.0 (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 4.0) tptp.c) (* 2.0 tptp.d)) (+ (* 1.0 1) (* (- 1.0) 7) (* (- 4.0) 11) (* 2.0 25))) true)) :rule trans :premises (t794.t11.t17 t794.t11.t18))
% 0.61/0.85  (step t794.t11.t20 (cl (= (not (>= (+ (* 1.0 (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 4.0) tptp.c) (* 2.0 tptp.d)) (+ (* 1.0 1) (* (- 1.0) 7) (* (- 4.0) 11) (* 2.0 25)))) (not true))) :rule cong :premises (t794.t11.t19))
% 0.61/0.85  (step t794.t11.t21 (cl (= (not true) false)) :rule all_simplify)
% 0.61/0.85  (step t794.t11.t22 (cl (= (not (>= (+ (* 1.0 (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 4.0) tptp.c) (* 2.0 tptp.d)) (+ (* 1.0 1) (* (- 1.0) 7) (* (- 4.0) 11) (* 2.0 25)))) false)) :rule trans :premises (t794.t11.t20 t794.t11.t21))
% 0.61/0.85  (step t794.t11.t23 (cl (= (< (+ (* 1.0 (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 4.0) tptp.c) (* 2.0 tptp.d)) (+ (* 1.0 1) (* (- 1.0) 7) (* (- 4.0) 11) (* 2.0 25))) false)) :rule trans :premises (t794.t11.t2 t794.t11.t22))
% 0.61/0.85  (step t794.t11.t24 (cl (not (< (* 1.0 (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 1.0 1))) (not (<= (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) 7))) (not (= (* (- 4.0) tptp.c) (* (- 4.0) 11))) (not (<= (* 2.0 tptp.d) (* 2.0 25))) (< (+ (* 1.0 (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 4.0) tptp.c) (* 2.0 tptp.d)) (+ (* 1.0 1) (* (- 1.0) 7) (* (- 4.0) 11) (* 2.0 25)))) :rule la_generic :args (1 1 (- 1) 1 1))
% 0.61/0.85  (step t794.t11.t25 (cl (=> (and (> 1.0 0) (< (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (< (* 1.0 (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 1.0 1)))) :rule la_mult_pos)
% 0.61/0.85  (step t794.t11.t26 (cl (not (and (> 1.0 0) (< (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (< (* 1.0 (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 1.0 1))) :rule implies :premises (t794.t11.t25))
% 0.61/0.85  (step t794.t11.t27 (cl (and (> 1.0 0) (< (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (> 1.0 0)) (not (< (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) :rule and_neg)
% 0.61/0.85  (step t794.t11.t28 (cl (= (= (> 1.0 0) true) (> 1.0 0))) :rule equiv_simplify)
% 0.61/0.85  (step t794.t11.t29 (cl (not (= (> 1.0 0) true)) (> 1.0 0)) :rule equiv1 :premises (t794.t11.t28))
% 0.61/0.85  (step t794.t11.t30 (cl (= (> 1.0 0) true)) :rule hole :args ((> 1.0 0)))
% 0.61/0.85  (step t794.t11.t31 (cl (> 1.0 0)) :rule resolution :premises (t794.t11.t29 t794.t11.t30))
% 0.61/0.85  (step t794.t11.t32 (cl (and (> 1.0 0) (< (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) :rule resolution :premises (t794.t11.t27 t794.t11.t31 t794.t11.a0))
% 0.61/0.85  (step t794.t11.t33 (cl (< (* 1.0 (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 1.0 1))) :rule resolution :premises (t794.t11.t26 t794.t11.t32))
% 0.61/0.85  (step t794.t11.t34 (cl (=> (and (< (- 1.0) 0) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (<= (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) 7)))) :rule la_mult_neg)
% 0.61/0.85  (step t794.t11.t35 (cl (not (and (< (- 1.0) 0) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (<= (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) 7))) :rule implies :premises (t794.t11.t34))
% 0.61/0.85  (step t794.t11.t36 (cl (and (< (- 1.0) 0) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (< (- 1.0) 0)) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule and_neg)
% 0.61/0.85  (step t794.t11.t37 (cl (= (= (< (- 1.0) 0) true) (< (- 1.0) 0))) :rule equiv_simplify)
% 0.61/0.85  (step t794.t11.t38 (cl (not (= (< (- 1.0) 0) true)) (< (- 1.0) 0)) :rule equiv1 :premises (t794.t11.t37))
% 0.61/0.85  (step t794.t11.t39 (cl (= (< (- 1.0) 0) true)) :rule hole :args ((< (- 1.0) 0)))
% 0.61/0.85  (step t794.t11.t40 (cl (< (- 1.0) 0)) :rule resolution :premises (t794.t11.t38 t794.t11.t39))
% 0.61/0.85  (step t794.t11.t41 (cl (and (< (- 1.0) 0) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule resolution :premises (t794.t11.t36 t794.t11.t40 t794.a2))
% 0.61/0.85  (step t794.t11.t42 (cl (<= (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) 7))) :rule resolution :premises (t794.t11.t35 t794.t11.t41))
% 0.61/0.85  (step t794.t11.t43 (cl (=> (and (< (- 4.0) 0) (= tptp.c 11)) (= (* (- 4.0) tptp.c) (* (- 4.0) 11)))) :rule la_mult_neg)
% 0.61/0.85  (step t794.t11.t44 (cl (not (and (< (- 4.0) 0) (= tptp.c 11))) (= (* (- 4.0) tptp.c) (* (- 4.0) 11))) :rule implies :premises (t794.t11.t43))
% 0.61/0.85  (step t794.t11.t45 (cl (and (< (- 4.0) 0) (= tptp.c 11)) (not (< (- 4.0) 0)) (not (= tptp.c 11))) :rule and_neg)
% 0.61/0.85  (step t794.t11.t46 (cl (= (= (< (- 4.0) 0) true) (< (- 4.0) 0))) :rule equiv_simplify)
% 0.61/0.85  (step t794.t11.t47 (cl (not (= (< (- 4.0) 0) true)) (< (- 4.0) 0)) :rule equiv1 :premises (t794.t11.t46))
% 0.61/0.85  (step t794.t11.t48 (cl (= (< (- 4.0) 0) true)) :rule hole :args ((< (- 4.0) 0)))
% 0.61/0.85  (step t794.t11.t49 (cl (< (- 4.0) 0)) :rule resolution :premises (t794.t11.t47 t794.t11.t48))
% 0.61/0.85  (step t794.t11.t50 (cl (and (< (- 4.0) 0) (= tptp.c 11))) :rule resolution :premises (t794.t11.t45 t794.t11.t49 t794.a1))
% 0.61/0.85  (step t794.t11.t51 (cl (= (* (- 4.0) tptp.c) (* (- 4.0) 11))) :rule resolution :premises (t794.t11.t44 t794.t11.t50))
% 0.61/0.85  (step t794.t11.t52 (cl (=> (and (> 2.0 0) (<= tptp.d 25)) (<= (* 2.0 tptp.d) (* 2.0 25)))) :rule la_mult_pos)
% 0.61/0.85  (step t794.t11.t53 (cl (not (and (> 2.0 0) (<= tptp.d 25))) (<= (* 2.0 tptp.d) (* 2.0 25))) :rule implies :premises (t794.t11.t52))
% 0.61/0.85  (step t794.t11.t54 (cl (and (> 2.0 0) (<= tptp.d 25)) (not (> 2.0 0)) (not (<= tptp.d 25))) :rule and_neg)
% 0.61/0.85  (step t794.t11.t55 (cl (= (= (> 2.0 0) true) (> 2.0 0))) :rule equiv_simplify)
% 0.61/0.85  (step t794.t11.t56 (cl (not (= (> 2.0 0) true)) (> 2.0 0)) :rule equiv1 :premises (t794.t11.t55))
% 0.61/0.85  (step t794.t11.t57 (cl (= (> 2.0 0) true)) :rule hole :args ((> 2.0 0)))
% 0.61/0.85  (step t794.t11.t58 (cl (> 2.0 0)) :rule resolution :premises (t794.t11.t56 t794.t11.t57))
% 0.61/0.85  (step t794.t11.t59 (cl (not (< tptp.d 26)) (<= tptp.d 25)) :rule la_generic :args (1 1))
% 0.61/0.85  (step t794.t11.t60 (cl (not (= (not (>= tptp.d 26)) (< tptp.d 26))) (not (not (>= tptp.d 26))) (< tptp.d 26)) :rule equiv_pos2)
% 0.61/0.85  (step t794.t11.t61 (cl (= (< tptp.d 26) (not (>= tptp.d 26)))) :rule all_simplify)
% 0.61/0.85  (step t794.t11.t62 (cl (= (not (>= tptp.d 26)) (< tptp.d 26))) :rule symm :premises (t794.t11.t61))
% 0.61/0.85  (step t794.t11.t63 (cl (< tptp.d 26)) :rule resolution :premises (t794.t11.t60 t794.t11.t62 t794.a0))
% 0.61/0.85  (step t794.t11.t64 (cl (<= tptp.d 25)) :rule resolution :premises (t794.t11.t59 t794.t11.t63))
% 0.61/0.85  (step t794.t11.t65 (cl (and (> 2.0 0) (<= tptp.d 25))) :rule resolution :premises (t794.t11.t54 t794.t11.t58 t794.t11.t64))
% 0.61/0.85  (step t794.t11.t66 (cl (<= (* 2.0 tptp.d) (* 2.0 25))) :rule resolution :premises (t794.t11.t53 t794.t11.t65))
% 0.61/0.85  (step t794.t11.t67 (cl (< (+ (* 1.0 (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 4.0) tptp.c) (* 2.0 tptp.d)) (+ (* 1.0 1) (* (- 1.0) 7) (* (- 4.0) 11) (* 2.0 25)))) :rule resolution :premises (t794.t11.t24 t794.t11.t33 t794.t11.t42 t794.t11.t51 t794.t11.t66))
% 0.61/0.85  (step t794.t11.t68 (cl false) :rule resolution :premises (t794.t11.t1 t794.t11.t23 t794.t11.t67))
% 0.61/0.85  (step t794.t11 (cl (not (< (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) false) :rule subproof :discharge (t794.t11.a0))
% 0.61/0.85  (step t794.t12 (cl (=> (< (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1) false) false) :rule resolution :premises (t794.t10 t794.t11))
% 0.61/0.85  (step t794.t13 (cl (=> (< (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1) false) (not false)) :rule implies_neg2)
% 0.61/0.85  (step t794.t14 (cl (=> (< (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1) false) (=> (< (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1) false)) :rule resolution :premises (t794.t12 t794.t13))
% 0.61/0.85  (step t794.t15 (cl (=> (< (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1) false)) :rule contraction :premises (t794.t14))
% 0.61/0.85  (step t794.t16 (cl (= (=> (< (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1) false) (not (< (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)))) :rule implies_simplify)
% 0.61/0.85  (step t794.t17 (cl (not (=> (< (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1) false)) (not (< (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) :rule equiv1 :premises (t794.t16))
% 0.61/0.85  (step t794.t18 (cl (not (< (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) :rule resolution :premises (t794.t15 t794.t17))
% 0.61/0.85  (step t794.t19 (cl (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) :rule resolution :premises (t794.t9 t794.t7 t794.t18))
% 0.61/0.85  (step t794.t20 (cl (not (< (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) :rule resolution :premises (t794.t5 t794.t8 t794.t19))
% 0.61/0.85  (step t794.t21 (cl) :rule resolution :premises (t794.t4 t794.t20))
% 0.61/0.85  (step t794 (cl (not (not (>= tptp.d 26))) (not (= tptp.c 11)) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) false) :rule subproof :discharge (t794.a0 t794.a1 t794.a2 t794.a3))
% 0.61/0.85  (step t795 (cl (not (and (not (>= tptp.d 26)) (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)))) (not (>= tptp.d 26))) :rule and_pos)
% 0.61/0.85  (step t796 (cl (not (and (not (>= tptp.d 26)) (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)))) (= tptp.c 11)) :rule and_pos)
% 0.61/0.85  (step t797 (cl (not (and (not (>= tptp.d 26)) (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)))) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) :rule and_pos)
% 0.61/0.85  (step t798 (cl (not (and (not (>= tptp.d 26)) (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)))) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) :rule and_pos)
% 0.61/0.85  (step t799 (cl false (not (and (not (>= tptp.d 26)) (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)))) (not (and (not (>= tptp.d 26)) (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)))) (not (and (not (>= tptp.d 26)) (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)))) (not (and (not (>= tptp.d 26)) (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))))) :rule resolution :premises (t794 t795 t796 t797 t798))
% 0.61/0.85  (step t800 (cl (not (and (not (>= tptp.d 26)) (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)))) (not (and (not (>= tptp.d 26)) (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)))) (not (and (not (>= tptp.d 26)) (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)))) (not (and (not (>= tptp.d 26)) (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)))) false) :rule reordering :premises (t799))
% 0.61/0.85  (step t801 (cl (not (and (not (>= tptp.d 26)) (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)))) false) :rule contraction :premises (t800))
% 0.61/0.85  (step t802 (cl (=> (and (not (>= tptp.d 26)) (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) false) false) :rule resolution :premises (t793 t801))
% 0.61/0.85  (step t803 (cl (=> (and (not (>= tptp.d 26)) (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) false) (not false)) :rule implies_neg2)
% 0.61/0.85  (step t804 (cl (=> (and (not (>= tptp.d 26)) (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) false) (=> (and (not (>= tptp.d 26)) (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) false)) :rule resolution :premises (t802 t803))
% 0.61/0.85  (step t805 (cl (=> (and (not (>= tptp.d 26)) (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) false)) :rule contraction :premises (t804))
% 0.61/0.85  (step t806 (cl (= (=> (and (not (>= tptp.d 26)) (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) false) (not (and (not (>= tptp.d 26)) (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)))))) :rule implies_simplify)
% 0.61/0.85  (step t807 (cl (not (=> (and (not (>= tptp.d 26)) (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) false)) (not (and (not (>= tptp.d 26)) (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))))) :rule equiv1 :premises (t806))
% 0.61/0.85  (step t808 (cl (not (and (not (>= tptp.d 26)) (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))))) :rule resolution :premises (t805 t807))
% 0.61/0.85  (step t809 (cl (= (and (not (>= tptp.d 26)) (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) false)) :rule resolution :premises (t792 t808))
% 0.61/0.85  (step t810 (cl (= (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 11) (not (>= tptp.d 26))) (and (not (>= tptp.d 26)) (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)))) (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 11) (not (>= tptp.d 26))) false))) :rule cong :premises (t788 t809))
% 0.61/0.85  (step t811 (cl (= (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 11) (not (>= tptp.d 26))) false) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 11) (not (>= tptp.d 26)))))) :rule all_simplify)
% 0.61/0.85  (step t812 (cl (= (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 11) (not (>= tptp.d 26))) (and (not (>= tptp.d 26)) (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 11) (not (>= tptp.d 26)))))) :rule trans :premises (t810 t811))
% 0.61/0.85  (step t813 (cl (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 11) (not (>= tptp.d 26))) (and (not (>= tptp.d 26)) (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)))) (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 11) (not (>= tptp.d 26)))) :rule implies_neg1)
% 0.61/0.85  (anchor :step t814)
% 0.61/0.85  (assume t814.a0 (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))
% 0.61/0.85  (assume t814.a1 (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)))
% 0.61/0.85  (assume t814.a2 (= tptp.c 11))
% 0.61/0.85  (assume t814.a3 (not (>= tptp.d 26)))
% 0.61/0.85  (step t814.t1 (cl (and (not (>= tptp.d 26)) (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (not (>= tptp.d 26))) (not (= tptp.c 11)) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)))) :rule and_neg)
% 0.61/0.85  (step t814.t2 (cl (and (not (>= tptp.d 26)) (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)))) :rule resolution :premises (t814.t1 t814.a3 t814.a2 t814.a0 t814.a1))
% 0.61/0.85  (step t814 (cl (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (= tptp.c 11)) (not (not (>= tptp.d 26))) (and (not (>= tptp.d 26)) (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)))) :rule subproof :discharge (t814.a0 t814.a1 t814.a2 t814.a3))
% 0.61/0.85  (step t815 (cl (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 11) (not (>= tptp.d 26)))) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) :rule and_pos)
% 0.61/0.85  (step t816 (cl (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 11) (not (>= tptp.d 26)))) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) :rule and_pos)
% 0.61/0.85  (step t817 (cl (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 11) (not (>= tptp.d 26)))) (= tptp.c 11)) :rule and_pos)
% 0.61/0.85  (step t818 (cl (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 11) (not (>= tptp.d 26)))) (not (>= tptp.d 26))) :rule and_pos)
% 0.61/0.85  (step t819 (cl (and (not (>= tptp.d 26)) (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 11) (not (>= tptp.d 26)))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 11) (not (>= tptp.d 26)))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 11) (not (>= tptp.d 26)))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 11) (not (>= tptp.d 26))))) :rule resolution :premises (t814 t815 t816 t817 t818))
% 0.61/0.85  (step t820 (cl (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 11) (not (>= tptp.d 26)))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 11) (not (>= tptp.d 26)))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 11) (not (>= tptp.d 26)))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 11) (not (>= tptp.d 26)))) (and (not (>= tptp.d 26)) (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)))) :rule reordering :premises (t819))
% 0.61/0.85  (step t821 (cl (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 11) (not (>= tptp.d 26)))) (and (not (>= tptp.d 26)) (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)))) :rule contraction :premises (t820))
% 0.61/0.85  (step t822 (cl (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 11) (not (>= tptp.d 26))) (and (not (>= tptp.d 26)) (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)))) (and (not (>= tptp.d 26)) (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)))) :rule resolution :premises (t813 t821))
% 0.61/0.85  (step t823 (cl (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 11) (not (>= tptp.d 26))) (and (not (>= tptp.d 26)) (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)))) (not (and (not (>= tptp.d 26)) (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))))) :rule implies_neg2)
% 0.61/0.85  (step t824 (cl (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 11) (not (>= tptp.d 26))) (and (not (>= tptp.d 26)) (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)))) (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 11) (not (>= tptp.d 26))) (and (not (>= tptp.d 26)) (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))))) :rule resolution :premises (t822 t823))
% 0.61/0.85  (step t825 (cl (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 11) (not (>= tptp.d 26))) (and (not (>= tptp.d 26)) (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))))) :rule contraction :premises (t824))
% 0.61/0.85  (step t826 (cl (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 11) (not (>= tptp.d 26))))) :rule resolution :premises (t787 t812 t825))
% 0.61/0.85  (step t827 (cl (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (= tptp.c 11)) (not (not (>= tptp.d 26)))) :rule not_and :premises (t826))
% 0.61/0.85  (step t828 (cl (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (= tptp.c 11)) (not (not (>= tptp.d 26)))) (not (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)))) :rule or_neg)
% 0.61/0.85  (step t829 (cl (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (= tptp.c 11)) (not (not (>= tptp.d 26)))) (not (not (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))))) :rule or_neg)
% 0.61/0.85  (step t830 (cl (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (= tptp.c 11)) (not (not (>= tptp.d 26)))) (not (not (= tptp.c 11)))) :rule or_neg)
% 0.61/0.85  (step t831 (cl (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (= tptp.c 11)) (not (not (>= tptp.d 26)))) (not (not (not (>= tptp.d 26))))) :rule or_neg)
% 0.61/0.85  (step t832 (cl (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (= tptp.c 11)) (not (not (>= tptp.d 26)))) (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (= tptp.c 11)) (not (not (>= tptp.d 26)))) (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (= tptp.c 11)) (not (not (>= tptp.d 26)))) (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (= tptp.c 11)) (not (not (>= tptp.d 26))))) :rule resolution :premises (t827 t828 t829 t830 t831))
% 0.61/0.85  (step t833 (cl (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (= tptp.c 11)) (not (not (>= tptp.d 26))))) :rule contraction :premises (t832))
% 0.61/0.85  (step t834 (cl (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1) (not (= tptp.c 11)) (>= tptp.d 26))) :rule resolution :premises (t774 t786 t833))
% 0.61/0.85  (step t835 (cl (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1) (not (= tptp.c 11)) (>= tptp.d 26)) :rule or :premises (t834))
% 0.61/0.85  (step t836 (cl (not (= (or (= tptp.d 26) (or (not (>= tptp.d 26)) (>= tptp.d 27))) (or (= tptp.d 26) (not (>= tptp.d 26)) (>= tptp.d 27)))) (not (or (= tptp.d 26) (or (not (>= tptp.d 26)) (>= tptp.d 27)))) (or (= tptp.d 26) (not (>= tptp.d 26)) (>= tptp.d 27))) :rule equiv_pos2)
% 0.61/0.85  (step t837 (cl (= (or (= tptp.d 26) (or (not (>= tptp.d 26)) (>= tptp.d 27))) (or (= tptp.d 26) (not (>= tptp.d 26)) (>= tptp.d 27)))) :rule all_simplify)
% 0.61/0.85  (step t838 (cl (not (= (or (not (not (= tptp.d 26))) (not (not (< tptp.d 26))) (not (not (> tptp.d 26)))) (or (= tptp.d 26) (or (not (>= tptp.d 26)) (>= tptp.d 27))))) (not (or (not (not (= tptp.d 26))) (not (not (< tptp.d 26))) (not (not (> tptp.d 26))))) (or (= tptp.d 26) (or (not (>= tptp.d 26)) (>= tptp.d 27)))) :rule equiv_pos2)
% 0.61/0.85  (step t839 (cl (= (not (not (= tptp.d 26))) (= tptp.d 26))) :rule all_simplify)
% 0.61/0.85  (step t840 (cl (= (not (not (< tptp.d 26))) (< tptp.d 26))) :rule all_simplify)
% 0.61/0.85  (step t841 (cl (= (< tptp.d 26) (not (>= tptp.d 26)))) :rule all_simplify)
% 0.61/0.85  (step t842 (cl (= (not (not (< tptp.d 26))) (not (>= tptp.d 26)))) :rule trans :premises (t840 t841))
% 0.61/0.85  (step t843 (cl (= (not (not (> tptp.d 26))) (> tptp.d 26))) :rule all_simplify)
% 0.61/0.85  (step t844 (cl (= (> tptp.d 26) (not (<= tptp.d 26)))) :rule all_simplify)
% 0.61/0.85  (step t845 (cl (= (<= tptp.d 26) (not (>= tptp.d 27)))) :rule all_simplify)
% 0.61/0.85  (step t846 (cl (= (not (<= tptp.d 26)) (not (not (>= tptp.d 27))))) :rule cong :premises (t845))
% 0.61/0.85  (step t847 (cl (= (not (not (>= tptp.d 27))) (>= tptp.d 27))) :rule all_simplify)
% 0.61/0.85  (step t848 (cl (= (not (<= tptp.d 26)) (>= tptp.d 27))) :rule trans :premises (t846 t847))
% 0.61/0.85  (step t849 (cl (= (> tptp.d 26) (>= tptp.d 27))) :rule trans :premises (t844 t848))
% 0.61/0.85  (step t850 (cl (= (not (not (> tptp.d 26))) (>= tptp.d 27))) :rule trans :premises (t843 t849))
% 0.61/0.85  (step t851 (cl (= (or (not (not (= tptp.d 26))) (not (not (< tptp.d 26))) (not (not (> tptp.d 26)))) (or (= tptp.d 26) (not (>= tptp.d 26)) (>= tptp.d 27)))) :rule cong :premises (t839 t842 t850))
% 0.61/0.85  (step t852 (cl (= (or (= tptp.d 26) (or (not (>= tptp.d 26)) (>= tptp.d 27))) (or (= tptp.d 26) (not (>= tptp.d 26)) (>= tptp.d 27)))) :rule all_simplify)
% 0.61/0.85  (step t853 (cl (= (or (= tptp.d 26) (not (>= tptp.d 26)) (>= tptp.d 27)) (or (= tptp.d 26) (or (not (>= tptp.d 26)) (>= tptp.d 27))))) :rule symm :premises (t852))
% 0.61/0.85  (step t854 (cl (= (or (not (not (= tptp.d 26))) (not (not (< tptp.d 26))) (not (not (> tptp.d 26)))) (or (= tptp.d 26) (or (not (>= tptp.d 26)) (>= tptp.d 27))))) :rule trans :premises (t851 t853))
% 0.61/0.85  (step t855 (cl (=> (and (not (= tptp.d 26)) (not (< tptp.d 26)) (not (> tptp.d 26))) false) (and (not (= tptp.d 26)) (not (< tptp.d 26)) (not (> tptp.d 26)))) :rule implies_neg1)
% 0.61/0.85  (anchor :step t856)
% 0.61/0.85  (assume t856.a0 (not (= tptp.d 26)))
% 0.61/0.85  (assume t856.a1 (not (< tptp.d 26)))
% 0.61/0.85  (assume t856.a2 (not (> tptp.d 26)))
% 0.61/0.85  (step t856.t1 (cl (or (= tptp.d 26) (not (<= tptp.d 26)) (not (<= 26 tptp.d)))) :rule la_disequality)
% 0.61/0.85  (step t856.t2 (cl (= tptp.d 26) (not (<= tptp.d 26)) (not (<= 26 tptp.d))) :rule or :premises (t856.t1))
% 0.61/0.85  (step t856.t3 (cl (not (= (>= tptp.d 26) (<= 26 tptp.d))) (not (>= tptp.d 26)) (<= 26 tptp.d)) :rule equiv_pos2)
% 0.61/0.85  (step t856.t4 (cl (= (>= tptp.d 26) (<= 26 tptp.d))) :rule comp_simplify)
% 0.61/0.85  (step t856.t5 (cl (<= 26 tptp.d)) :rule resolution :premises (t856.t3 t856.t4 t856.a0))
% 0.61/0.85  (step t856.t6 (cl (not (<= tptp.d 26))) :rule resolution :premises (t856.t2 t856.t5 t856.a1))
% 0.61/0.85  (step t856.t7 (cl (not (= (> tptp.d 26) (not (<= tptp.d 26)))) (> tptp.d 26) (not (not (<= tptp.d 26)))) :rule equiv_pos1)
% 0.61/0.85  (step t856.t8 (cl (= (> tptp.d 26) (not (<= tptp.d 26)))) :rule comp_simplify)
% 0.61/0.85  (step t856.t9 (cl (> tptp.d 26)) :rule resolution :premises (t856.t6 t856.t7 t856.t8))
% 0.61/0.85  (step t856.t10 (cl) :rule resolution :premises (t856.t9 t856.a2))
% 0.61/0.85  (step t856 (cl (not (not (= tptp.d 26))) (not (not (< tptp.d 26))) (not (not (> tptp.d 26))) false) :rule subproof :discharge (t856.a0 t856.a1 t856.a2))
% 0.61/0.85  (step t857 (cl (not (and (not (= tptp.d 26)) (not (< tptp.d 26)) (not (> tptp.d 26)))) (not (= tptp.d 26))) :rule and_pos)
% 0.61/0.85  (step t858 (cl (not (and (not (= tptp.d 26)) (not (< tptp.d 26)) (not (> tptp.d 26)))) (not (< tptp.d 26))) :rule and_pos)
% 0.61/0.85  (step t859 (cl (not (and (not (= tptp.d 26)) (not (< tptp.d 26)) (not (> tptp.d 26)))) (not (> tptp.d 26))) :rule and_pos)
% 0.61/0.85  (step t860 (cl false (not (and (not (= tptp.d 26)) (not (< tptp.d 26)) (not (> tptp.d 26)))) (not (and (not (= tptp.d 26)) (not (< tptp.d 26)) (not (> tptp.d 26)))) (not (and (not (= tptp.d 26)) (not (< tptp.d 26)) (not (> tptp.d 26))))) :rule resolution :premises (t856 t857 t858 t859))
% 0.61/0.85  (step t861 (cl (not (and (not (= tptp.d 26)) (not (< tptp.d 26)) (not (> tptp.d 26)))) (not (and (not (= tptp.d 26)) (not (< tptp.d 26)) (not (> tptp.d 26)))) (not (and (not (= tptp.d 26)) (not (< tptp.d 26)) (not (> tptp.d 26)))) false) :rule reordering :premises (t860))
% 0.61/0.85  (step t862 (cl (not (and (not (= tptp.d 26)) (not (< tptp.d 26)) (not (> tptp.d 26)))) false) :rule contraction :premises (t861))
% 0.61/0.85  (step t863 (cl (=> (and (not (= tptp.d 26)) (not (< tptp.d 26)) (not (> tptp.d 26))) false) false) :rule resolution :premises (t855 t862))
% 0.61/0.85  (step t864 (cl (=> (and (not (= tptp.d 26)) (not (< tptp.d 26)) (not (> tptp.d 26))) false) (not false)) :rule implies_neg2)
% 0.61/0.85  (step t865 (cl (=> (and (not (= tptp.d 26)) (not (< tptp.d 26)) (not (> tptp.d 26))) false) (=> (and (not (= tptp.d 26)) (not (< tptp.d 26)) (not (> tptp.d 26))) false)) :rule resolution :premises (t863 t864))
% 0.61/0.85  (step t866 (cl (=> (and (not (= tptp.d 26)) (not (< tptp.d 26)) (not (> tptp.d 26))) false)) :rule contraction :premises (t865))
% 0.61/0.85  (step t867 (cl (= (=> (and (not (= tptp.d 26)) (not (< tptp.d 26)) (not (> tptp.d 26))) false) (not (and (not (= tptp.d 26)) (not (< tptp.d 26)) (not (> tptp.d 26)))))) :rule implies_simplify)
% 0.61/0.85  (step t868 (cl (not (=> (and (not (= tptp.d 26)) (not (< tptp.d 26)) (not (> tptp.d 26))) false)) (not (and (not (= tptp.d 26)) (not (< tptp.d 26)) (not (> tptp.d 26))))) :rule equiv1 :premises (t867))
% 0.61/0.85  (step t869 (cl (not (and (not (= tptp.d 26)) (not (< tptp.d 26)) (not (> tptp.d 26))))) :rule resolution :premises (t866 t868))
% 0.61/0.85  (step t870 (cl (not (not (= tptp.d 26))) (not (not (< tptp.d 26))) (not (not (> tptp.d 26)))) :rule not_and :premises (t869))
% 0.61/0.85  (step t871 (cl (or (not (not (= tptp.d 26))) (not (not (< tptp.d 26))) (not (not (> tptp.d 26)))) (not (not (not (= tptp.d 26))))) :rule or_neg)
% 0.61/0.85  (step t872 (cl (or (not (not (= tptp.d 26))) (not (not (< tptp.d 26))) (not (not (> tptp.d 26)))) (not (not (not (< tptp.d 26))))) :rule or_neg)
% 0.61/0.85  (step t873 (cl (or (not (not (= tptp.d 26))) (not (not (< tptp.d 26))) (not (not (> tptp.d 26)))) (not (not (not (> tptp.d 26))))) :rule or_neg)
% 0.61/0.85  (step t874 (cl (or (not (not (= tptp.d 26))) (not (not (< tptp.d 26))) (not (not (> tptp.d 26)))) (or (not (not (= tptp.d 26))) (not (not (< tptp.d 26))) (not (not (> tptp.d 26)))) (or (not (not (= tptp.d 26))) (not (not (< tptp.d 26))) (not (not (> tptp.d 26))))) :rule resolution :premises (t870 t871 t872 t873))
% 0.61/0.85  (step t875 (cl (or (not (not (= tptp.d 26))) (not (not (< tptp.d 26))) (not (not (> tptp.d 26))))) :rule contraction :premises (t874))
% 0.61/0.85  (step t876 (cl (or (= tptp.d 26) (or (not (>= tptp.d 26)) (>= tptp.d 27)))) :rule resolution :premises (t838 t854 t875))
% 0.61/0.85  (step t877 (cl (or (= tptp.d 26) (not (>= tptp.d 26)) (>= tptp.d 27))) :rule resolution :premises (t836 t837 t876))
% 0.61/0.85  (step t878 (cl (= tptp.d 26) (not (>= tptp.d 26)) (>= tptp.d 27)) :rule or :premises (t877))
% 0.61/0.85  (step t879 (cl (not (>= tptp.d 26)) (>= tptp.d 27) (= tptp.d 26)) :rule reordering :premises (t878))
% 0.61/0.85  (step t880 (cl (not (= (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) (not (= tptp.c 11)) (not (>= tptp.d 27))) (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1) (not (= tptp.c 11)) (not (>= tptp.d 27))))) (not (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) (not (= tptp.c 11)) (not (>= tptp.d 27)))) (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1) (not (= tptp.c 11)) (not (>= tptp.d 27)))) :rule equiv_pos2)
% 0.61/0.85  (step t881 (cl (= (not (>= tptp.d 27)) (not (>= tptp.d 27)))) :rule refl)
% 0.61/0.85  (step t882 (cl (= (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) (not (= tptp.c 11)) (not (>= tptp.d 27))) (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1) (not (= tptp.c 11)) (not (>= tptp.d 27))))) :rule cong :premises (t46 t713 t775 t881))
% 0.61/0.85  (step t883 (cl (not (= (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 11) (>= tptp.d 27)) (and (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= tptp.d 27))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 11) (>= tptp.d 27))))) (not (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 11) (>= tptp.d 27)) (and (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= tptp.d 27)))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 11) (>= tptp.d 27)))) :rule equiv_pos2)
% 0.61/0.85  (step t884 (cl (= (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 11) (>= tptp.d 27)) (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 11) (>= tptp.d 27)))) :rule refl)
% 0.61/0.85  (step t885 (cl (= (= (and (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= tptp.d 27)) false) (not (and (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= tptp.d 27))))) :rule equiv_simplify)
% 0.61/0.85  (step t886 (cl (= (and (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= tptp.d 27)) false) (not (not (and (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= tptp.d 27))))) :rule equiv2 :premises (t885))
% 0.61/0.85  (step t887 (cl (not (not (not (and (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= tptp.d 27))))) (and (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= tptp.d 27))) :rule not_not)
% 0.61/0.85  (step t888 (cl (= (and (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= tptp.d 27)) false) (and (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= tptp.d 27))) :rule resolution :premises (t886 t887))
% 0.61/0.85  (step t889 (cl (=> (and (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= tptp.d 27)) false) (and (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= tptp.d 27))) :rule implies_neg1)
% 0.61/0.85  (anchor :step t890)
% 0.61/0.85  (assume t890.a0 (= tptp.c 11))
% 0.61/0.85  (assume t890.a1 (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))
% 0.61/0.85  (assume t890.a2 (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)))
% 0.61/0.85  (assume t890.a3 (>= tptp.d 27))
% 0.61/0.85  (step t890.t1 (cl (not (= (< tptp.d 27) (not (>= tptp.d 27)))) (not (< tptp.d 27)) (not (>= tptp.d 27))) :rule equiv_pos2)
% 0.61/0.85  (step t890.t2 (cl (= (< tptp.d 27) (not (>= tptp.d 27)))) :rule all_simplify)
% 0.61/0.85  (step t890.t3 (cl (not (= (not (>= tptp.d 27)) (< tptp.d 27))) (not (not (>= tptp.d 27))) (< tptp.d 27)) :rule equiv_pos2)
% 0.61/0.85  (step t890.t4 (cl (= (not (>= tptp.d 27)) (< tptp.d 27))) :rule symm :premises (t890.t2))
% 0.61/0.85  (step t890.t5 (cl (=> (>= tptp.d 27) false) (>= tptp.d 27)) :rule implies_neg1)
% 0.61/0.85  (anchor :step t890.t6)
% 0.61/0.85  (assume t890.t6.a0 (>= tptp.d 27))
% 0.61/0.85  (step t890.t6.t1 (cl (not (= (< (+ (* (- 1.0) tptp.d) (* 1.0 (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 3.0 tptp.c)) (+ (* (- 1.0) 27) (* 1.0 1) (* (- 1.0) 7) (* 3.0 11))) false)) (not (< (+ (* (- 1.0) tptp.d) (* 1.0 (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 3.0 tptp.c)) (+ (* (- 1.0) 27) (* 1.0 1) (* (- 1.0) 7) (* 3.0 11)))) false) :rule equiv_pos2)
% 0.61/0.85  (step t890.t6.t2 (cl (= (< (+ (* (- 1.0) tptp.d) (* 1.0 (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 3.0 tptp.c)) (+ (* (- 1.0) 27) (* 1.0 1) (* (- 1.0) 7) (* 3.0 11))) (not (>= (+ (* (- 1.0) tptp.d) (* 1.0 (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 3.0 tptp.c)) (+ (* (- 1.0) 27) (* 1.0 1) (* (- 1.0) 7) (* 3.0 11)))))) :rule all_simplify)
% 0.61/0.85  (step t890.t6.t3 (cl (= (* (- 1.0) tptp.d) (to_real (* (- 1) tptp.d)))) :rule all_simplify)
% 0.61/0.85  (step t890.t6.t4 (cl (= (* 1.0 (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c)))) (to_real (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c)))))) :rule all_simplify)
% 0.61/0.85  (step t890.t6.t5 (cl (= (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (to_real (+ (* (- 2) tptp.d) (* (- 3) tptp.c) (* tptp.d tptp.c))))) :rule all_simplify)
% 0.61/0.85  (step t890.t6.t6 (cl (= (* 3.0 tptp.c) (to_real (* 3 tptp.c)))) :rule all_simplify)
% 0.61/0.85  (step t890.t6.t7 (cl (= (+ (* (- 1.0) tptp.d) (* 1.0 (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 3.0 tptp.c)) (+ (to_real (* (- 1) tptp.d)) (to_real (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c)))) (to_real (+ (* (- 2) tptp.d) (* (- 3) tptp.c) (* tptp.d tptp.c))) (to_real (* 3 tptp.c))))) :rule cong :premises (t890.t6.t3 t890.t6.t4 t890.t6.t5 t890.t6.t6))
% 0.61/0.85  (step t890.t6.t8 (cl (= (+ (to_real (* (- 1) tptp.d)) (to_real (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c)))) (to_real (+ (* (- 2) tptp.d) (* (- 3) tptp.c) (* tptp.d tptp.c))) (to_real (* 3 tptp.c))) 0.0)) :rule all_simplify)
% 0.61/0.85  (step t890.t6.t9 (cl (= (+ (* (- 1.0) tptp.d) (* 1.0 (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 3.0 tptp.c)) 0.0)) :rule trans :premises (t890.t6.t7 t890.t6.t8))
% 0.61/0.85  (step t890.t6.t10 (cl (= (* (- 1.0) 27) (- 27.0))) :rule all_simplify)
% 0.61/0.85  (step t890.t6.t11 (cl (= (* 1.0 1) 1.0)) :rule all_simplify)
% 0.61/0.85  (step t890.t6.t12 (cl (= (* (- 1.0) 7) (- 7.0))) :rule all_simplify)
% 0.61/0.85  (step t890.t6.t13 (cl (= (* 3.0 11) 33.0)) :rule all_simplify)
% 0.61/0.85  (step t890.t6.t14 (cl (= (+ (* (- 1.0) 27) (* 1.0 1) (* (- 1.0) 7) (* 3.0 11)) (+ (- 27.0) 1.0 (- 7.0) 33.0))) :rule cong :premises (t890.t6.t10 t890.t6.t11 t890.t6.t12 t890.t6.t13))
% 0.61/0.85  (step t890.t6.t15 (cl (= (+ (- 27.0) 1.0 (- 7.0) 33.0) 0.0)) :rule all_simplify)
% 0.61/0.85  (step t890.t6.t16 (cl (= (+ (* (- 1.0) 27) (* 1.0 1) (* (- 1.0) 7) (* 3.0 11)) 0.0)) :rule trans :premises (t890.t6.t14 t890.t6.t15))
% 0.61/0.85  (step t890.t6.t17 (cl (= (>= (+ (* (- 1.0) tptp.d) (* 1.0 (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 3.0 tptp.c)) (+ (* (- 1.0) 27) (* 1.0 1) (* (- 1.0) 7) (* 3.0 11))) (>= 0.0 0.0))) :rule cong :premises (t890.t6.t9 t890.t6.t16))
% 0.61/0.85  (step t890.t6.t18 (cl (= (>= 0.0 0.0) true)) :rule all_simplify)
% 0.61/0.85  (step t890.t6.t19 (cl (= (>= (+ (* (- 1.0) tptp.d) (* 1.0 (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 3.0 tptp.c)) (+ (* (- 1.0) 27) (* 1.0 1) (* (- 1.0) 7) (* 3.0 11))) true)) :rule trans :premises (t890.t6.t17 t890.t6.t18))
% 0.61/0.85  (step t890.t6.t20 (cl (= (not (>= (+ (* (- 1.0) tptp.d) (* 1.0 (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 3.0 tptp.c)) (+ (* (- 1.0) 27) (* 1.0 1) (* (- 1.0) 7) (* 3.0 11)))) (not true))) :rule cong :premises (t890.t6.t19))
% 0.61/0.85  (step t890.t6.t21 (cl (= (not true) false)) :rule all_simplify)
% 0.61/0.85  (step t890.t6.t22 (cl (= (not (>= (+ (* (- 1.0) tptp.d) (* 1.0 (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 3.0 tptp.c)) (+ (* (- 1.0) 27) (* 1.0 1) (* (- 1.0) 7) (* 3.0 11)))) false)) :rule trans :premises (t890.t6.t20 t890.t6.t21))
% 0.61/0.85  (step t890.t6.t23 (cl (= (< (+ (* (- 1.0) tptp.d) (* 1.0 (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 3.0 tptp.c)) (+ (* (- 1.0) 27) (* 1.0 1) (* (- 1.0) 7) (* 3.0 11))) false)) :rule trans :premises (t890.t6.t2 t890.t6.t22))
% 0.61/0.85  (step t890.t6.t24 (cl (not (<= (* (- 1.0) tptp.d) (* (- 1.0) 27))) (not (< (* 1.0 (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c)))) (* 1.0 1))) (not (<= (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) 7))) (not (= (* 3.0 tptp.c) (* 3.0 11))) (< (+ (* (- 1.0) tptp.d) (* 1.0 (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 3.0 tptp.c)) (+ (* (- 1.0) 27) (* 1.0 1) (* (- 1.0) 7) (* 3.0 11)))) :rule la_generic :args (1 1 1 (- 1) 1))
% 0.61/0.85  (step t890.t6.t25 (cl (=> (and (< (- 1.0) 0) (>= tptp.d 27)) (<= (* (- 1.0) tptp.d) (* (- 1.0) 27)))) :rule la_mult_neg)
% 0.61/0.85  (step t890.t6.t26 (cl (not (and (< (- 1.0) 0) (>= tptp.d 27))) (<= (* (- 1.0) tptp.d) (* (- 1.0) 27))) :rule implies :premises (t890.t6.t25))
% 0.61/0.85  (step t890.t6.t27 (cl (and (< (- 1.0) 0) (>= tptp.d 27)) (not (< (- 1.0) 0)) (not (>= tptp.d 27))) :rule and_neg)
% 0.61/0.85  (step t890.t6.t28 (cl (= (= (< (- 1.0) 0) true) (< (- 1.0) 0))) :rule equiv_simplify)
% 0.61/0.85  (step t890.t6.t29 (cl (not (= (< (- 1.0) 0) true)) (< (- 1.0) 0)) :rule equiv1 :premises (t890.t6.t28))
% 0.61/0.85  (step t890.t6.t30 (cl (= (< (- 1.0) 0) true)) :rule hole :args ((< (- 1.0) 0)))
% 0.61/0.85  (step t890.t6.t31 (cl (< (- 1.0) 0)) :rule resolution :premises (t890.t6.t29 t890.t6.t30))
% 0.61/0.85  (step t890.t6.t32 (cl (and (< (- 1.0) 0) (>= tptp.d 27))) :rule resolution :premises (t890.t6.t27 t890.t6.t31 t890.t6.a0))
% 0.61/0.85  (step t890.t6.t33 (cl (<= (* (- 1.0) tptp.d) (* (- 1.0) 27))) :rule resolution :premises (t890.t6.t26 t890.t6.t32))
% 0.61/0.85  (step t890.t6.t34 (cl (=> (and (> 1.0 0) (< (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (< (* 1.0 (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c)))) (* 1.0 1)))) :rule la_mult_pos)
% 0.61/0.85  (step t890.t6.t35 (cl (not (and (> 1.0 0) (< (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) (< (* 1.0 (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c)))) (* 1.0 1))) :rule implies :premises (t890.t6.t34))
% 0.61/0.85  (step t890.t6.t36 (cl (and (> 1.0 0) (< (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (> 1.0 0)) (not (< (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) :rule and_neg)
% 0.61/0.85  (step t890.t6.t37 (cl (= (= (> 1.0 0) true) (> 1.0 0))) :rule equiv_simplify)
% 0.61/0.85  (step t890.t6.t38 (cl (not (= (> 1.0 0) true)) (> 1.0 0)) :rule equiv1 :premises (t890.t6.t37))
% 0.61/0.85  (step t890.t6.t39 (cl (= (> 1.0 0) true)) :rule hole :args ((> 1.0 0)))
% 0.61/0.85  (step t890.t6.t40 (cl (> 1.0 0)) :rule resolution :premises (t890.t6.t38 t890.t6.t39))
% 0.61/0.85  (step t890.t6.t41 (cl (not (= (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (< (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) (not (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) (< (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) :rule equiv_pos2)
% 0.61/0.85  (step t890.t6.t42 (cl (= (< (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)))) :rule all_simplify)
% 0.61/0.85  (step t890.t6.t43 (cl (= (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (< (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) :rule symm :premises (t890.t6.t42))
% 0.61/0.85  (step t890.t6.t44 (cl (< (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) :rule resolution :premises (t890.t6.t41 t890.t6.t43 t890.a2))
% 0.61/0.85  (step t890.t6.t45 (cl (and (> 1.0 0) (< (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) :rule resolution :premises (t890.t6.t36 t890.t6.t40 t890.t6.t44))
% 0.61/0.85  (step t890.t6.t46 (cl (< (* 1.0 (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c)))) (* 1.0 1))) :rule resolution :premises (t890.t6.t35 t890.t6.t45))
% 0.61/0.85  (step t890.t6.t47 (cl (=> (and (< (- 1.0) 0) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (<= (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) 7)))) :rule la_mult_neg)
% 0.61/0.85  (step t890.t6.t48 (cl (not (and (< (- 1.0) 0) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (<= (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) 7))) :rule implies :premises (t890.t6.t47))
% 0.61/0.85  (step t890.t6.t49 (cl (and (< (- 1.0) 0) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (< (- 1.0) 0)) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule and_neg)
% 0.61/0.85  (step t890.t6.t50 (cl (and (< (- 1.0) 0) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule resolution :premises (t890.t6.t49 t890.t6.t31 t890.a1))
% 0.61/0.85  (step t890.t6.t51 (cl (<= (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) 7))) :rule resolution :premises (t890.t6.t48 t890.t6.t50))
% 0.61/0.85  (step t890.t6.t52 (cl (=> (and (> 3.0 0) (= tptp.c 11)) (= (* 3.0 tptp.c) (* 3.0 11)))) :rule la_mult_pos)
% 0.61/0.85  (step t890.t6.t53 (cl (not (and (> 3.0 0) (= tptp.c 11))) (= (* 3.0 tptp.c) (* 3.0 11))) :rule implies :premises (t890.t6.t52))
% 0.61/0.85  (step t890.t6.t54 (cl (and (> 3.0 0) (= tptp.c 11)) (not (> 3.0 0)) (not (= tptp.c 11))) :rule and_neg)
% 0.61/0.85  (step t890.t6.t55 (cl (= (= (> 3.0 0) true) (> 3.0 0))) :rule equiv_simplify)
% 0.61/0.85  (step t890.t6.t56 (cl (not (= (> 3.0 0) true)) (> 3.0 0)) :rule equiv1 :premises (t890.t6.t55))
% 0.61/0.85  (step t890.t6.t57 (cl (= (> 3.0 0) true)) :rule hole :args ((> 3.0 0)))
% 0.61/0.85  (step t890.t6.t58 (cl (> 3.0 0)) :rule resolution :premises (t890.t6.t56 t890.t6.t57))
% 0.61/0.85  (step t890.t6.t59 (cl (and (> 3.0 0) (= tptp.c 11))) :rule resolution :premises (t890.t6.t54 t890.t6.t58 t890.a0))
% 0.61/0.85  (step t890.t6.t60 (cl (= (* 3.0 tptp.c) (* 3.0 11))) :rule resolution :premises (t890.t6.t53 t890.t6.t59))
% 0.61/0.85  (step t890.t6.t61 (cl (< (+ (* (- 1.0) tptp.d) (* 1.0 (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 3.0 tptp.c)) (+ (* (- 1.0) 27) (* 1.0 1) (* (- 1.0) 7) (* 3.0 11)))) :rule resolution :premises (t890.t6.t24 t890.t6.t33 t890.t6.t46 t890.t6.t51 t890.t6.t60))
% 0.61/0.85  (step t890.t6.t62 (cl false) :rule resolution :premises (t890.t6.t1 t890.t6.t23 t890.t6.t61))
% 0.61/0.85  (step t890.t6 (cl (not (>= tptp.d 27)) false) :rule subproof :discharge (t890.t6.a0))
% 0.61/0.85  (step t890.t7 (cl (=> (>= tptp.d 27) false) false) :rule resolution :premises (t890.t5 t890.t6))
% 0.61/0.85  (step t890.t8 (cl (=> (>= tptp.d 27) false) (not false)) :rule implies_neg2)
% 0.61/0.85  (step t890.t9 (cl (=> (>= tptp.d 27) false) (=> (>= tptp.d 27) false)) :rule resolution :premises (t890.t7 t890.t8))
% 0.61/0.85  (step t890.t10 (cl (=> (>= tptp.d 27) false)) :rule contraction :premises (t890.t9))
% 0.61/0.85  (step t890.t11 (cl (= (=> (>= tptp.d 27) false) (not (>= tptp.d 27)))) :rule implies_simplify)
% 0.61/0.85  (step t890.t12 (cl (not (=> (>= tptp.d 27) false)) (not (>= tptp.d 27))) :rule equiv1 :premises (t890.t11))
% 0.61/0.85  (step t890.t13 (cl (not (>= tptp.d 27))) :rule resolution :premises (t890.t10 t890.t12))
% 0.61/0.85  (step t890.t14 (cl (< tptp.d 27)) :rule resolution :premises (t890.t3 t890.t4 t890.t13))
% 0.61/0.85  (step t890.t15 (cl (not (>= tptp.d 27))) :rule resolution :premises (t890.t1 t890.t2 t890.t14))
% 0.61/0.85  (step t890.t16 (cl) :rule resolution :premises (t890.a3 t890.t15))
% 0.61/0.85  (step t890 (cl (not (= tptp.c 11)) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) (not (>= tptp.d 27)) false) :rule subproof :discharge (t890.a0 t890.a1 t890.a2 t890.a3))
% 0.61/0.85  (step t891 (cl (not (and (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= tptp.d 27))) (= tptp.c 11)) :rule and_pos)
% 0.61/0.85  (step t892 (cl (not (and (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= tptp.d 27))) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) :rule and_pos)
% 0.61/0.85  (step t893 (cl (not (and (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= tptp.d 27))) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) :rule and_pos)
% 0.61/0.85  (step t894 (cl (not (and (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= tptp.d 27))) (>= tptp.d 27)) :rule and_pos)
% 0.61/0.85  (step t895 (cl false (not (and (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= tptp.d 27))) (not (and (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= tptp.d 27))) (not (and (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= tptp.d 27))) (not (and (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= tptp.d 27)))) :rule resolution :premises (t890 t891 t892 t893 t894))
% 0.61/0.85  (step t896 (cl (not (and (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= tptp.d 27))) (not (and (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= tptp.d 27))) (not (and (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= tptp.d 27))) (not (and (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= tptp.d 27))) false) :rule reordering :premises (t895))
% 0.61/0.85  (step t897 (cl (not (and (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= tptp.d 27))) false) :rule contraction :premises (t896))
% 0.61/0.85  (step t898 (cl (=> (and (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= tptp.d 27)) false) false) :rule resolution :premises (t889 t897))
% 0.61/0.85  (step t899 (cl (=> (and (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= tptp.d 27)) false) (not false)) :rule implies_neg2)
% 0.61/0.85  (step t900 (cl (=> (and (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= tptp.d 27)) false) (=> (and (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= tptp.d 27)) false)) :rule resolution :premises (t898 t899))
% 0.61/0.85  (step t901 (cl (=> (and (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= tptp.d 27)) false)) :rule contraction :premises (t900))
% 0.61/0.85  (step t902 (cl (= (=> (and (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= tptp.d 27)) false) (not (and (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= tptp.d 27))))) :rule implies_simplify)
% 0.61/0.85  (step t903 (cl (not (=> (and (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= tptp.d 27)) false)) (not (and (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= tptp.d 27)))) :rule equiv1 :premises (t902))
% 0.61/0.85  (step t904 (cl (not (and (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= tptp.d 27)))) :rule resolution :premises (t901 t903))
% 0.61/0.85  (step t905 (cl (= (and (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= tptp.d 27)) false)) :rule resolution :premises (t888 t904))
% 0.61/0.85  (step t906 (cl (= (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 11) (>= tptp.d 27)) (and (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= tptp.d 27))) (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 11) (>= tptp.d 27)) false))) :rule cong :premises (t884 t905))
% 0.61/0.85  (step t907 (cl (= (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 11) (>= tptp.d 27)) false) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 11) (>= tptp.d 27))))) :rule all_simplify)
% 0.61/0.85  (step t908 (cl (= (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 11) (>= tptp.d 27)) (and (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= tptp.d 27))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 11) (>= tptp.d 27))))) :rule trans :premises (t906 t907))
% 0.61/0.85  (step t909 (cl (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 11) (>= tptp.d 27)) (and (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= tptp.d 27))) (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 11) (>= tptp.d 27))) :rule implies_neg1)
% 0.61/0.85  (anchor :step t910)
% 0.61/0.85  (assume t910.a0 (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))
% 0.61/0.85  (assume t910.a1 (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)))
% 0.61/0.85  (assume t910.a2 (= tptp.c 11))
% 0.61/0.85  (assume t910.a3 (>= tptp.d 27))
% 0.61/0.85  (step t910.t1 (cl (and (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= tptp.d 27)) (not (= tptp.c 11)) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) (not (>= tptp.d 27))) :rule and_neg)
% 0.61/0.85  (step t910.t2 (cl (and (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= tptp.d 27))) :rule resolution :premises (t910.t1 t910.a2 t910.a0 t910.a1 t910.a3))
% 0.61/0.85  (step t910 (cl (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) (not (= tptp.c 11)) (not (>= tptp.d 27)) (and (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= tptp.d 27))) :rule subproof :discharge (t910.a0 t910.a1 t910.a2 t910.a3))
% 0.61/0.85  (step t911 (cl (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 11) (>= tptp.d 27))) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) :rule and_pos)
% 0.61/0.85  (step t912 (cl (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 11) (>= tptp.d 27))) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) :rule and_pos)
% 0.61/0.85  (step t913 (cl (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 11) (>= tptp.d 27))) (= tptp.c 11)) :rule and_pos)
% 0.61/0.85  (step t914 (cl (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 11) (>= tptp.d 27))) (>= tptp.d 27)) :rule and_pos)
% 0.61/0.85  (step t915 (cl (and (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= tptp.d 27)) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 11) (>= tptp.d 27))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 11) (>= tptp.d 27))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 11) (>= tptp.d 27))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 11) (>= tptp.d 27)))) :rule resolution :premises (t910 t911 t912 t913 t914))
% 0.61/0.85  (step t916 (cl (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 11) (>= tptp.d 27))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 11) (>= tptp.d 27))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 11) (>= tptp.d 27))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 11) (>= tptp.d 27))) (and (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= tptp.d 27))) :rule reordering :premises (t915))
% 0.61/0.85  (step t917 (cl (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 11) (>= tptp.d 27))) (and (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= tptp.d 27))) :rule contraction :premises (t916))
% 0.61/0.85  (step t918 (cl (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 11) (>= tptp.d 27)) (and (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= tptp.d 27))) (and (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= tptp.d 27))) :rule resolution :premises (t909 t917))
% 0.61/0.85  (step t919 (cl (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 11) (>= tptp.d 27)) (and (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= tptp.d 27))) (not (and (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= tptp.d 27)))) :rule implies_neg2)
% 0.61/0.85  (step t920 (cl (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 11) (>= tptp.d 27)) (and (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= tptp.d 27))) (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 11) (>= tptp.d 27)) (and (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= tptp.d 27)))) :rule resolution :premises (t918 t919))
% 0.61/0.85  (step t921 (cl (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 11) (>= tptp.d 27)) (and (= tptp.c 11) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (>= tptp.d 27)))) :rule contraction :premises (t920))
% 0.61/0.85  (step t922 (cl (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.c 11) (>= tptp.d 27)))) :rule resolution :premises (t883 t908 t921))
% 0.61/0.85  (step t923 (cl (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) (not (= tptp.c 11)) (not (>= tptp.d 27))) :rule not_and :premises (t922))
% 0.61/0.85  (step t924 (cl (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) (not (= tptp.c 11)) (not (>= tptp.d 27))) (not (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)))) :rule or_neg)
% 0.61/0.85  (step t925 (cl (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) (not (= tptp.c 11)) (not (>= tptp.d 27))) (not (not (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))))) :rule or_neg)
% 0.61/0.85  (step t926 (cl (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) (not (= tptp.c 11)) (not (>= tptp.d 27))) (not (not (= tptp.c 11)))) :rule or_neg)
% 0.61/0.85  (step t927 (cl (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) (not (= tptp.c 11)) (not (>= tptp.d 27))) (not (not (>= tptp.d 27)))) :rule or_neg)
% 0.61/0.85  (step t928 (cl (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) (not (= tptp.c 11)) (not (>= tptp.d 27))) (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) (not (= tptp.c 11)) (not (>= tptp.d 27))) (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) (not (= tptp.c 11)) (not (>= tptp.d 27))) (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) (not (= tptp.c 11)) (not (>= tptp.d 27)))) :rule resolution :premises (t923 t924 t925 t926 t927))
% 0.61/0.85  (step t929 (cl (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) (not (= tptp.c 11)) (not (>= tptp.d 27)))) :rule contraction :premises (t928))
% 0.61/0.85  (step t930 (cl (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1) (not (= tptp.c 11)) (not (>= tptp.d 27)))) :rule resolution :premises (t880 t882 t929))
% 0.61/0.85  (step t931 (cl (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1) (not (= tptp.c 11)) (not (>= tptp.d 27))) :rule or :premises (t930))
% 0.61/0.85  (step t932 (cl (not (= (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= tptp.c 12))) (not (not (>= tptp.d 27))) (not (= (* tptp.d tptp.c) 286))) (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (>= tptp.c 12) (>= tptp.d 27) (not (= (* tptp.d tptp.c) 286))))) (not (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= tptp.c 12))) (not (not (>= tptp.d 27))) (not (= (* tptp.d tptp.c) 286)))) (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (>= tptp.c 12) (>= tptp.d 27) (not (= (* tptp.d tptp.c) 286)))) :rule equiv_pos2)
% 0.61/0.85  (step t933 (cl (= (= (= (not (not (>= tptp.c 12))) (>= tptp.c 12)) true) (= (not (not (>= tptp.c 12))) (>= tptp.c 12)))) :rule equiv_simplify)
% 0.61/0.85  (step t934 (cl (not (= (= (not (not (>= tptp.c 12))) (>= tptp.c 12)) true)) (= (not (not (>= tptp.c 12))) (>= tptp.c 12))) :rule equiv1 :premises (t933))
% 0.61/0.85  (step t935 (cl (= (= (not (not (>= tptp.c 12))) (>= tptp.c 12)) (= (>= tptp.c 12) (not (not (>= tptp.c 12)))))) :rule all_simplify)
% 0.61/0.85  (step t936 (cl (= (>= tptp.c 12) (>= tptp.c 12))) :rule refl)
% 0.61/0.85  (step t937 (cl (= (= (>= tptp.c 12) (not (not (>= tptp.c 12)))) (= (>= tptp.c 12) (>= tptp.c 12)))) :rule cong :premises (t936 t641))
% 0.61/0.85  (step t938 (cl (= (= (>= tptp.c 12) (>= tptp.c 12)) true)) :rule all_simplify)
% 0.61/0.85  (step t939 (cl (= (= (>= tptp.c 12) (not (not (>= tptp.c 12)))) true)) :rule trans :premises (t937 t938))
% 0.61/0.85  (step t940 (cl (= (= (not (not (>= tptp.c 12))) (>= tptp.c 12)) true)) :rule trans :premises (t935 t939))
% 0.61/0.85  (step t941 (cl (= (not (not (>= tptp.c 12))) (>= tptp.c 12))) :rule resolution :premises (t934 t940))
% 0.61/0.85  (step t942 (cl (= (= (= (not (not (>= tptp.d 27))) (>= tptp.d 27)) true) (= (not (not (>= tptp.d 27))) (>= tptp.d 27)))) :rule equiv_simplify)
% 0.61/0.85  (step t943 (cl (not (= (= (not (not (>= tptp.d 27))) (>= tptp.d 27)) true)) (= (not (not (>= tptp.d 27))) (>= tptp.d 27))) :rule equiv1 :premises (t942))
% 0.61/0.85  (step t944 (cl (= (= (not (not (>= tptp.d 27))) (>= tptp.d 27)) (= (>= tptp.d 27) (not (not (>= tptp.d 27)))))) :rule all_simplify)
% 0.61/0.85  (step t945 (cl (= (>= tptp.d 27) (>= tptp.d 27))) :rule refl)
% 0.61/0.85  (step t946 (cl (= (= (>= tptp.d 27) (not (not (>= tptp.d 27)))) (= (>= tptp.d 27) (>= tptp.d 27)))) :rule cong :premises (t945 t847))
% 0.61/0.85  (step t947 (cl (= (= (>= tptp.d 27) (>= tptp.d 27)) true)) :rule all_simplify)
% 0.61/0.85  (step t948 (cl (= (= (>= tptp.d 27) (not (not (>= tptp.d 27)))) true)) :rule trans :premises (t946 t947))
% 0.61/0.85  (step t949 (cl (= (= (not (not (>= tptp.d 27))) (>= tptp.d 27)) true)) :rule trans :premises (t944 t948))
% 0.61/0.85  (step t950 (cl (= (not (not (>= tptp.d 27))) (>= tptp.d 27))) :rule resolution :premises (t943 t949))
% 0.61/0.85  (step t951 (cl (= (not (= (* tptp.d tptp.c) 286)) (not (= (* tptp.d tptp.c) 286)))) :rule refl)
% 0.61/0.85  (step t952 (cl (= (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= tptp.c 12))) (not (not (>= tptp.d 27))) (not (= (* tptp.d tptp.c) 286))) (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (>= tptp.c 12) (>= tptp.d 27) (not (= (* tptp.d tptp.c) 286))))) :rule cong :premises (t46 t941 t950 t951))
% 0.61/0.85  (step t953 (cl (not (= (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= tptp.c 12)) (not (>= tptp.d 27)) (= (* tptp.d tptp.c) 286)) (and (not (>= tptp.c 12)) (= (* tptp.d tptp.c) 286) (not (>= tptp.d 27)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= tptp.c 12)) (not (>= tptp.d 27)) (= (* tptp.d tptp.c) 286))))) (not (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= tptp.c 12)) (not (>= tptp.d 27)) (= (* tptp.d tptp.c) 286)) (and (not (>= tptp.c 12)) (= (* tptp.d tptp.c) 286) (not (>= tptp.d 27)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= tptp.c 12)) (not (>= tptp.d 27)) (= (* tptp.d tptp.c) 286)))) :rule equiv_pos2)
% 0.61/0.85  (step t954 (cl (= (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= tptp.c 12)) (not (>= tptp.d 27)) (= (* tptp.d tptp.c) 286)) (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= tptp.c 12)) (not (>= tptp.d 27)) (= (* tptp.d tptp.c) 286)))) :rule refl)
% 0.61/0.85  (step t955 (cl (= (= (and (not (>= tptp.c 12)) (= (* tptp.d tptp.c) 286) (not (>= tptp.d 27)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) false) (not (and (not (>= tptp.c 12)) (= (* tptp.d tptp.c) 286) (not (>= tptp.d 27)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))))) :rule equiv_simplify)
% 0.61/0.85  (step t956 (cl (= (and (not (>= tptp.c 12)) (= (* tptp.d tptp.c) 286) (not (>= tptp.d 27)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) false) (not (not (and (not (>= tptp.c 12)) (= (* tptp.d tptp.c) 286) (not (>= tptp.d 27)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))))) :rule equiv2 :premises (t955))
% 0.61/0.85  (step t957 (cl (not (not (not (and (not (>= tptp.c 12)) (= (* tptp.d tptp.c) 286) (not (>= tptp.d 27)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))))) (and (not (>= tptp.c 12)) (= (* tptp.d tptp.c) 286) (not (>= tptp.d 27)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule not_not)
% 0.61/0.85  (step t958 (cl (= (and (not (>= tptp.c 12)) (= (* tptp.d tptp.c) 286) (not (>= tptp.d 27)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) false) (and (not (>= tptp.c 12)) (= (* tptp.d tptp.c) 286) (not (>= tptp.d 27)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule resolution :premises (t956 t957))
% 0.61/0.85  (step t959 (cl (=> (and (not (>= tptp.c 12)) (= (* tptp.d tptp.c) 286) (not (>= tptp.d 27)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) false) (and (not (>= tptp.c 12)) (= (* tptp.d tptp.c) 286) (not (>= tptp.d 27)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule implies_neg1)
% 0.61/0.85  (anchor :step t960)
% 0.61/0.85  (assume t960.a0 (not (>= tptp.c 12)))
% 0.61/0.85  (assume t960.a1 (= (* tptp.d tptp.c) 286))
% 0.61/0.85  (assume t960.a2 (not (>= tptp.d 27)))
% 0.61/0.85  (assume t960.a3 (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))
% 0.61/0.85  (step t960.t1 (cl (not (= (< (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)))) (not (< (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule equiv_pos2)
% 0.61/0.85  (step t960.t2 (cl (= (< (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)))) :rule all_simplify)
% 0.61/0.85  (step t960.t3 (cl (not (= (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (< (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (not (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (< (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) :rule equiv_pos2)
% 0.61/0.85  (step t960.t4 (cl (= (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (< (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule symm :premises (t960.t2))
% 0.61/0.85  (step t960.t5 (cl (=> (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) false) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) :rule implies_neg1)
% 0.61/0.85  (anchor :step t960.t6)
% 0.61/0.85  (assume t960.t6.a0 (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))
% 0.61/0.85  (step t960.t6.t1 (cl (not (= (< (+ (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 2.0 tptp.d) (* (- 1.0) (* tptp.d tptp.c)) (* 3.0 tptp.c)) (+ (* (- 1.0) 7) (* 2.0 27) (* (- 1.0) 286) (* 3.0 12))) false)) (not (< (+ (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 2.0 tptp.d) (* (- 1.0) (* tptp.d tptp.c)) (* 3.0 tptp.c)) (+ (* (- 1.0) 7) (* 2.0 27) (* (- 1.0) 286) (* 3.0 12)))) false) :rule equiv_pos2)
% 0.61/0.85  (step t960.t6.t2 (cl (= (< (+ (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 2.0 tptp.d) (* (- 1.0) (* tptp.d tptp.c)) (* 3.0 tptp.c)) (+ (* (- 1.0) 7) (* 2.0 27) (* (- 1.0) 286) (* 3.0 12))) (not (>= (+ (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 2.0 tptp.d) (* (- 1.0) (* tptp.d tptp.c)) (* 3.0 tptp.c)) (+ (* (- 1.0) 7) (* 2.0 27) (* (- 1.0) 286) (* 3.0 12)))))) :rule all_simplify)
% 0.61/0.85  (step t960.t6.t3 (cl (= (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (to_real (+ (* (- 2) tptp.d) (* (- 3) tptp.c) (* tptp.d tptp.c))))) :rule all_simplify)
% 0.61/0.85  (step t960.t6.t4 (cl (= (* 2.0 tptp.d) (to_real (* 2 tptp.d)))) :rule all_simplify)
% 0.61/0.85  (step t960.t6.t5 (cl (= (* (- 1.0) (* tptp.d tptp.c)) (to_real (* (- 1) (* tptp.d tptp.c))))) :rule all_simplify)
% 0.61/0.85  (step t960.t6.t6 (cl (= (* 3.0 tptp.c) (to_real (* 3 tptp.c)))) :rule all_simplify)
% 0.61/0.85  (step t960.t6.t7 (cl (= (+ (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 2.0 tptp.d) (* (- 1.0) (* tptp.d tptp.c)) (* 3.0 tptp.c)) (+ (to_real (+ (* (- 2) tptp.d) (* (- 3) tptp.c) (* tptp.d tptp.c))) (to_real (* 2 tptp.d)) (to_real (* (- 1) (* tptp.d tptp.c))) (to_real (* 3 tptp.c))))) :rule cong :premises (t960.t6.t3 t960.t6.t4 t960.t6.t5 t960.t6.t6))
% 0.61/0.85  (step t960.t6.t8 (cl (= (+ (to_real (+ (* (- 2) tptp.d) (* (- 3) tptp.c) (* tptp.d tptp.c))) (to_real (* 2 tptp.d)) (to_real (* (- 1) (* tptp.d tptp.c))) (to_real (* 3 tptp.c))) 0.0)) :rule all_simplify)
% 0.61/0.85  (step t960.t6.t9 (cl (= (+ (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 2.0 tptp.d) (* (- 1.0) (* tptp.d tptp.c)) (* 3.0 tptp.c)) 0.0)) :rule trans :premises (t960.t6.t7 t960.t6.t8))
% 0.61/0.85  (step t960.t6.t10 (cl (= (* (- 1.0) 7) (- 7.0))) :rule all_simplify)
% 0.61/0.85  (step t960.t6.t11 (cl (= (* 2.0 27) 54.0)) :rule all_simplify)
% 0.61/0.85  (step t960.t6.t12 (cl (= (* (- 1.0) 286) (- 286.0))) :rule all_simplify)
% 0.61/0.85  (step t960.t6.t13 (cl (= (* 3.0 12) 36.0)) :rule all_simplify)
% 0.61/0.85  (step t960.t6.t14 (cl (= (+ (* (- 1.0) 7) (* 2.0 27) (* (- 1.0) 286) (* 3.0 12)) (+ (- 7.0) 54.0 (- 286.0) 36.0))) :rule cong :premises (t960.t6.t10 t960.t6.t11 t960.t6.t12 t960.t6.t13))
% 0.61/0.85  (step t960.t6.t15 (cl (= (+ (- 7.0) 54.0 (- 286.0) 36.0) (- 203.0))) :rule all_simplify)
% 0.61/0.85  (step t960.t6.t16 (cl (= (+ (* (- 1.0) 7) (* 2.0 27) (* (- 1.0) 286) (* 3.0 12)) (- 203.0))) :rule trans :premises (t960.t6.t14 t960.t6.t15))
% 0.61/0.85  (step t960.t6.t17 (cl (= (>= (+ (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 2.0 tptp.d) (* (- 1.0) (* tptp.d tptp.c)) (* 3.0 tptp.c)) (+ (* (- 1.0) 7) (* 2.0 27) (* (- 1.0) 286) (* 3.0 12))) (>= 0.0 (- 203.0)))) :rule cong :premises (t960.t6.t9 t960.t6.t16))
% 0.61/0.85  (step t960.t6.t18 (cl (= (>= 0.0 (- 203.0)) true)) :rule all_simplify)
% 0.61/0.85  (step t960.t6.t19 (cl (= (>= (+ (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 2.0 tptp.d) (* (- 1.0) (* tptp.d tptp.c)) (* 3.0 tptp.c)) (+ (* (- 1.0) 7) (* 2.0 27) (* (- 1.0) 286) (* 3.0 12))) true)) :rule trans :premises (t960.t6.t17 t960.t6.t18))
% 0.61/0.85  (step t960.t6.t20 (cl (= (not (>= (+ (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 2.0 tptp.d) (* (- 1.0) (* tptp.d tptp.c)) (* 3.0 tptp.c)) (+ (* (- 1.0) 7) (* 2.0 27) (* (- 1.0) 286) (* 3.0 12)))) (not true))) :rule cong :premises (t960.t6.t19))
% 0.61/0.85  (step t960.t6.t21 (cl (= (not true) false)) :rule all_simplify)
% 0.61/0.85  (step t960.t6.t22 (cl (= (not (>= (+ (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 2.0 tptp.d) (* (- 1.0) (* tptp.d tptp.c)) (* 3.0 tptp.c)) (+ (* (- 1.0) 7) (* 2.0 27) (* (- 1.0) 286) (* 3.0 12)))) false)) :rule trans :premises (t960.t6.t20 t960.t6.t21))
% 0.61/0.85  (step t960.t6.t23 (cl (= (< (+ (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 2.0 tptp.d) (* (- 1.0) (* tptp.d tptp.c)) (* 3.0 tptp.c)) (+ (* (- 1.0) 7) (* 2.0 27) (* (- 1.0) 286) (* 3.0 12))) false)) :rule trans :premises (t960.t6.t2 t960.t6.t22))
% 0.61/0.85  (step t960.t6.t24 (cl (not (<= (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) 7))) (not (< (* 2.0 tptp.d) (* 2.0 27))) (not (= (* (- 1.0) (* tptp.d tptp.c)) (* (- 1.0) 286))) (not (< (* 3.0 tptp.c) (* 3.0 12))) (< (+ (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 2.0 tptp.d) (* (- 1.0) (* tptp.d tptp.c)) (* 3.0 tptp.c)) (+ (* (- 1.0) 7) (* 2.0 27) (* (- 1.0) 286) (* 3.0 12)))) :rule la_generic :args (1 1 (- 1) 1 1))
% 0.61/0.85  (step t960.t6.t25 (cl (=> (and (< (- 1.0) 0) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (<= (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) 7)))) :rule la_mult_neg)
% 0.61/0.85  (step t960.t6.t26 (cl (not (and (< (- 1.0) 0) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (<= (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) 7))) :rule implies :premises (t960.t6.t25))
% 0.61/0.85  (step t960.t6.t27 (cl (and (< (- 1.0) 0) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (< (- 1.0) 0)) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule and_neg)
% 0.61/0.85  (step t960.t6.t28 (cl (= (= (< (- 1.0) 0) true) (< (- 1.0) 0))) :rule equiv_simplify)
% 0.61/0.85  (step t960.t6.t29 (cl (not (= (< (- 1.0) 0) true)) (< (- 1.0) 0)) :rule equiv1 :premises (t960.t6.t28))
% 0.61/0.85  (step t960.t6.t30 (cl (= (< (- 1.0) 0) true)) :rule hole :args ((< (- 1.0) 0)))
% 0.61/0.85  (step t960.t6.t31 (cl (< (- 1.0) 0)) :rule resolution :premises (t960.t6.t29 t960.t6.t30))
% 0.61/0.85  (step t960.t6.t32 (cl (and (< (- 1.0) 0) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule resolution :premises (t960.t6.t27 t960.t6.t31 t960.t6.a0))
% 0.61/0.85  (step t960.t6.t33 (cl (<= (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) 7))) :rule resolution :premises (t960.t6.t26 t960.t6.t32))
% 0.61/0.85  (step t960.t6.t34 (cl (=> (and (> 2.0 0) (< tptp.d 27)) (< (* 2.0 tptp.d) (* 2.0 27)))) :rule la_mult_pos)
% 0.61/0.85  (step t960.t6.t35 (cl (not (and (> 2.0 0) (< tptp.d 27))) (< (* 2.0 tptp.d) (* 2.0 27))) :rule implies :premises (t960.t6.t34))
% 0.61/0.85  (step t960.t6.t36 (cl (and (> 2.0 0) (< tptp.d 27)) (not (> 2.0 0)) (not (< tptp.d 27))) :rule and_neg)
% 0.61/0.85  (step t960.t6.t37 (cl (= (= (> 2.0 0) true) (> 2.0 0))) :rule equiv_simplify)
% 0.61/0.85  (step t960.t6.t38 (cl (not (= (> 2.0 0) true)) (> 2.0 0)) :rule equiv1 :premises (t960.t6.t37))
% 0.61/0.85  (step t960.t6.t39 (cl (= (> 2.0 0) true)) :rule hole :args ((> 2.0 0)))
% 0.61/0.85  (step t960.t6.t40 (cl (> 2.0 0)) :rule resolution :premises (t960.t6.t38 t960.t6.t39))
% 0.61/0.85  (step t960.t6.t41 (cl (not (= (not (>= tptp.d 27)) (< tptp.d 27))) (not (not (>= tptp.d 27))) (< tptp.d 27)) :rule equiv_pos2)
% 0.61/0.85  (step t960.t6.t42 (cl (= (< tptp.d 27) (not (>= tptp.d 27)))) :rule all_simplify)
% 0.61/0.85  (step t960.t6.t43 (cl (= (not (>= tptp.d 27)) (< tptp.d 27))) :rule symm :premises (t960.t6.t42))
% 0.61/0.85  (step t960.t6.t44 (cl (< tptp.d 27)) :rule resolution :premises (t960.t6.t41 t960.t6.t43 t960.a2))
% 0.61/0.85  (step t960.t6.t45 (cl (and (> 2.0 0) (< tptp.d 27))) :rule resolution :premises (t960.t6.t36 t960.t6.t40 t960.t6.t44))
% 0.61/0.85  (step t960.t6.t46 (cl (< (* 2.0 tptp.d) (* 2.0 27))) :rule resolution :premises (t960.t6.t35 t960.t6.t45))
% 0.61/0.85  (step t960.t6.t47 (cl (=> (and (< (- 1.0) 0) (= (* tptp.d tptp.c) 286)) (= (* (- 1.0) (* tptp.d tptp.c)) (* (- 1.0) 286)))) :rule la_mult_neg)
% 0.61/0.85  (step t960.t6.t48 (cl (not (and (< (- 1.0) 0) (= (* tptp.d tptp.c) 286))) (= (* (- 1.0) (* tptp.d tptp.c)) (* (- 1.0) 286))) :rule implies :premises (t960.t6.t47))
% 0.61/0.85  (step t960.t6.t49 (cl (and (< (- 1.0) 0) (= (* tptp.d tptp.c) 286)) (not (< (- 1.0) 0)) (not (= (* tptp.d tptp.c) 286))) :rule and_neg)
% 0.61/0.85  (step t960.t6.t50 (cl (and (< (- 1.0) 0) (= (* tptp.d tptp.c) 286))) :rule resolution :premises (t960.t6.t49 t960.t6.t31 t960.a1))
% 0.61/0.85  (step t960.t6.t51 (cl (= (* (- 1.0) (* tptp.d tptp.c)) (* (- 1.0) 286))) :rule resolution :premises (t960.t6.t48 t960.t6.t50))
% 0.61/0.85  (step t960.t6.t52 (cl (=> (and (> 3.0 0) (< tptp.c 12)) (< (* 3.0 tptp.c) (* 3.0 12)))) :rule la_mult_pos)
% 0.61/0.85  (step t960.t6.t53 (cl (not (and (> 3.0 0) (< tptp.c 12))) (< (* 3.0 tptp.c) (* 3.0 12))) :rule implies :premises (t960.t6.t52))
% 0.61/0.85  (step t960.t6.t54 (cl (and (> 3.0 0) (< tptp.c 12)) (not (> 3.0 0)) (not (< tptp.c 12))) :rule and_neg)
% 0.61/0.85  (step t960.t6.t55 (cl (= (= (> 3.0 0) true) (> 3.0 0))) :rule equiv_simplify)
% 0.61/0.85  (step t960.t6.t56 (cl (not (= (> 3.0 0) true)) (> 3.0 0)) :rule equiv1 :premises (t960.t6.t55))
% 0.61/0.85  (step t960.t6.t57 (cl (= (> 3.0 0) true)) :rule hole :args ((> 3.0 0)))
% 0.61/0.85  (step t960.t6.t58 (cl (> 3.0 0)) :rule resolution :premises (t960.t6.t56 t960.t6.t57))
% 0.61/0.85  (step t960.t6.t59 (cl (not (= (not (>= tptp.c 12)) (< tptp.c 12))) (not (not (>= tptp.c 12))) (< tptp.c 12)) :rule equiv_pos2)
% 0.61/0.85  (step t960.t6.t60 (cl (= (< tptp.c 12) (not (>= tptp.c 12)))) :rule all_simplify)
% 0.61/0.85  (step t960.t6.t61 (cl (= (not (>= tptp.c 12)) (< tptp.c 12))) :rule symm :premises (t960.t6.t60))
% 0.61/0.85  (step t960.t6.t62 (cl (< tptp.c 12)) :rule resolution :premises (t960.t6.t59 t960.t6.t61 t960.a0))
% 0.61/0.85  (step t960.t6.t63 (cl (and (> 3.0 0) (< tptp.c 12))) :rule resolution :premises (t960.t6.t54 t960.t6.t58 t960.t6.t62))
% 0.61/0.85  (step t960.t6.t64 (cl (< (* 3.0 tptp.c) (* 3.0 12))) :rule resolution :premises (t960.t6.t53 t960.t6.t63))
% 0.61/0.85  (step t960.t6.t65 (cl (< (+ (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 2.0 tptp.d) (* (- 1.0) (* tptp.d tptp.c)) (* 3.0 tptp.c)) (+ (* (- 1.0) 7) (* 2.0 27) (* (- 1.0) 286) (* 3.0 12)))) :rule resolution :premises (t960.t6.t24 t960.t6.t33 t960.t6.t46 t960.t6.t51 t960.t6.t64))
% 0.61/0.85  (step t960.t6.t66 (cl false) :rule resolution :premises (t960.t6.t1 t960.t6.t23 t960.t6.t65))
% 0.61/0.85  (step t960.t6 (cl (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) false) :rule subproof :discharge (t960.t6.a0))
% 0.61/0.85  (step t960.t7 (cl (=> (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) false) false) :rule resolution :premises (t960.t5 t960.t6))
% 0.61/0.85  (step t960.t8 (cl (=> (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) false) (not false)) :rule implies_neg2)
% 0.61/0.85  (step t960.t9 (cl (=> (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) false) (=> (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) false)) :rule resolution :premises (t960.t7 t960.t8))
% 0.61/0.85  (step t960.t10 (cl (=> (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) false)) :rule contraction :premises (t960.t9))
% 0.61/0.85  (step t960.t11 (cl (= (=> (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) false) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)))) :rule implies_simplify)
% 0.61/0.85  (step t960.t12 (cl (not (=> (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) false)) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule equiv1 :premises (t960.t11))
% 0.61/0.85  (step t960.t13 (cl (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule resolution :premises (t960.t10 t960.t12))
% 0.61/0.85  (step t960.t14 (cl (< (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) :rule resolution :premises (t960.t3 t960.t4 t960.t13))
% 0.61/0.85  (step t960.t15 (cl (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule resolution :premises (t960.t1 t960.t2 t960.t14))
% 0.61/0.85  (step t960.t16 (cl) :rule resolution :premises (t960.a3 t960.t15))
% 0.61/0.85  (step t960 (cl (not (not (>= tptp.c 12))) (not (= (* tptp.d tptp.c) 286)) (not (not (>= tptp.d 27))) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) false) :rule subproof :discharge (t960.a0 t960.a1 t960.a2 t960.a3))
% 0.61/0.85  (step t961 (cl (not (and (not (>= tptp.c 12)) (= (* tptp.d tptp.c) 286) (not (>= tptp.d 27)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (not (>= tptp.c 12))) :rule and_pos)
% 0.61/0.85  (step t962 (cl (not (and (not (>= tptp.c 12)) (= (* tptp.d tptp.c) 286) (not (>= tptp.d 27)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (= (* tptp.d tptp.c) 286)) :rule and_pos)
% 0.61/0.85  (step t963 (cl (not (and (not (>= tptp.c 12)) (= (* tptp.d tptp.c) 286) (not (>= tptp.d 27)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (not (>= tptp.d 27))) :rule and_pos)
% 0.61/0.85  (step t964 (cl (not (and (not (>= tptp.c 12)) (= (* tptp.d tptp.c) 286) (not (>= tptp.d 27)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) :rule and_pos)
% 0.61/0.85  (step t965 (cl false (not (and (not (>= tptp.c 12)) (= (* tptp.d tptp.c) 286) (not (>= tptp.d 27)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (not (and (not (>= tptp.c 12)) (= (* tptp.d tptp.c) 286) (not (>= tptp.d 27)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (not (and (not (>= tptp.c 12)) (= (* tptp.d tptp.c) 286) (not (>= tptp.d 27)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (not (and (not (>= tptp.c 12)) (= (* tptp.d tptp.c) 286) (not (>= tptp.d 27)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)))) :rule resolution :premises (t960 t961 t962 t963 t964))
% 0.61/0.85  (step t966 (cl (not (and (not (>= tptp.c 12)) (= (* tptp.d tptp.c) 286) (not (>= tptp.d 27)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (not (and (not (>= tptp.c 12)) (= (* tptp.d tptp.c) 286) (not (>= tptp.d 27)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (not (and (not (>= tptp.c 12)) (= (* tptp.d tptp.c) 286) (not (>= tptp.d 27)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (not (and (not (>= tptp.c 12)) (= (* tptp.d tptp.c) 286) (not (>= tptp.d 27)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) false) :rule reordering :premises (t965))
% 0.61/0.85  (step t967 (cl (not (and (not (>= tptp.c 12)) (= (* tptp.d tptp.c) 286) (not (>= tptp.d 27)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) false) :rule contraction :premises (t966))
% 0.61/0.85  (step t968 (cl (=> (and (not (>= tptp.c 12)) (= (* tptp.d tptp.c) 286) (not (>= tptp.d 27)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) false) false) :rule resolution :premises (t959 t967))
% 0.61/0.85  (step t969 (cl (=> (and (not (>= tptp.c 12)) (= (* tptp.d tptp.c) 286) (not (>= tptp.d 27)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) false) (not false)) :rule implies_neg2)
% 0.61/0.85  (step t970 (cl (=> (and (not (>= tptp.c 12)) (= (* tptp.d tptp.c) 286) (not (>= tptp.d 27)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) false) (=> (and (not (>= tptp.c 12)) (= (* tptp.d tptp.c) 286) (not (>= tptp.d 27)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) false)) :rule resolution :premises (t968 t969))
% 0.61/0.85  (step t971 (cl (=> (and (not (>= tptp.c 12)) (= (* tptp.d tptp.c) 286) (not (>= tptp.d 27)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) false)) :rule contraction :premises (t970))
% 0.61/0.85  (step t972 (cl (= (=> (and (not (>= tptp.c 12)) (= (* tptp.d tptp.c) 286) (not (>= tptp.d 27)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) false) (not (and (not (>= tptp.c 12)) (= (* tptp.d tptp.c) 286) (not (>= tptp.d 27)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))))) :rule implies_simplify)
% 0.61/0.85  (step t973 (cl (not (=> (and (not (>= tptp.c 12)) (= (* tptp.d tptp.c) 286) (not (>= tptp.d 27)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) false)) (not (and (not (>= tptp.c 12)) (= (* tptp.d tptp.c) 286) (not (>= tptp.d 27)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)))) :rule equiv1 :premises (t972))
% 0.61/0.85  (step t974 (cl (not (and (not (>= tptp.c 12)) (= (* tptp.d tptp.c) 286) (not (>= tptp.d 27)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)))) :rule resolution :premises (t971 t973))
% 0.61/0.85  (step t975 (cl (= (and (not (>= tptp.c 12)) (= (* tptp.d tptp.c) 286) (not (>= tptp.d 27)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) false)) :rule resolution :premises (t958 t974))
% 0.61/0.85  (step t976 (cl (= (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= tptp.c 12)) (not (>= tptp.d 27)) (= (* tptp.d tptp.c) 286)) (and (not (>= tptp.c 12)) (= (* tptp.d tptp.c) 286) (not (>= tptp.d 27)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= tptp.c 12)) (not (>= tptp.d 27)) (= (* tptp.d tptp.c) 286)) false))) :rule cong :premises (t954 t975))
% 0.61/0.85  (step t977 (cl (= (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= tptp.c 12)) (not (>= tptp.d 27)) (= (* tptp.d tptp.c) 286)) false) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= tptp.c 12)) (not (>= tptp.d 27)) (= (* tptp.d tptp.c) 286))))) :rule all_simplify)
% 0.61/0.85  (step t978 (cl (= (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= tptp.c 12)) (not (>= tptp.d 27)) (= (* tptp.d tptp.c) 286)) (and (not (>= tptp.c 12)) (= (* tptp.d tptp.c) 286) (not (>= tptp.d 27)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= tptp.c 12)) (not (>= tptp.d 27)) (= (* tptp.d tptp.c) 286))))) :rule trans :premises (t976 t977))
% 0.61/0.85  (step t979 (cl (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= tptp.c 12)) (not (>= tptp.d 27)) (= (* tptp.d tptp.c) 286)) (and (not (>= tptp.c 12)) (= (* tptp.d tptp.c) 286) (not (>= tptp.d 27)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= tptp.c 12)) (not (>= tptp.d 27)) (= (* tptp.d tptp.c) 286))) :rule implies_neg1)
% 0.61/0.85  (anchor :step t980)
% 0.61/0.85  (assume t980.a0 (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))
% 0.61/0.85  (assume t980.a1 (not (>= tptp.c 12)))
% 0.61/0.85  (assume t980.a2 (not (>= tptp.d 27)))
% 0.61/0.85  (assume t980.a3 (= (* tptp.d tptp.c) 286))
% 0.61/0.85  (step t980.t1 (cl (and (not (>= tptp.c 12)) (= (* tptp.d tptp.c) 286) (not (>= tptp.d 27)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= tptp.c 12))) (not (= (* tptp.d tptp.c) 286)) (not (not (>= tptp.d 27))) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule and_neg)
% 0.61/0.85  (step t980.t2 (cl (and (not (>= tptp.c 12)) (= (* tptp.d tptp.c) 286) (not (>= tptp.d 27)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule resolution :premises (t980.t1 t980.a1 t980.a3 t980.a2 t980.a0))
% 0.61/0.85  (step t980 (cl (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= tptp.c 12))) (not (not (>= tptp.d 27))) (not (= (* tptp.d tptp.c) 286)) (and (not (>= tptp.c 12)) (= (* tptp.d tptp.c) 286) (not (>= tptp.d 27)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule subproof :discharge (t980.a0 t980.a1 t980.a2 t980.a3))
% 0.61/0.85  (step t981 (cl (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= tptp.c 12)) (not (>= tptp.d 27)) (= (* tptp.d tptp.c) 286))) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) :rule and_pos)
% 0.61/0.85  (step t982 (cl (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= tptp.c 12)) (not (>= tptp.d 27)) (= (* tptp.d tptp.c) 286))) (not (>= tptp.c 12))) :rule and_pos)
% 0.61/0.85  (step t983 (cl (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= tptp.c 12)) (not (>= tptp.d 27)) (= (* tptp.d tptp.c) 286))) (not (>= tptp.d 27))) :rule and_pos)
% 0.61/0.85  (step t984 (cl (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= tptp.c 12)) (not (>= tptp.d 27)) (= (* tptp.d tptp.c) 286))) (= (* tptp.d tptp.c) 286)) :rule and_pos)
% 0.61/0.85  (step t985 (cl (and (not (>= tptp.c 12)) (= (* tptp.d tptp.c) 286) (not (>= tptp.d 27)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= tptp.c 12)) (not (>= tptp.d 27)) (= (* tptp.d tptp.c) 286))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= tptp.c 12)) (not (>= tptp.d 27)) (= (* tptp.d tptp.c) 286))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= tptp.c 12)) (not (>= tptp.d 27)) (= (* tptp.d tptp.c) 286))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= tptp.c 12)) (not (>= tptp.d 27)) (= (* tptp.d tptp.c) 286)))) :rule resolution :premises (t980 t981 t982 t983 t984))
% 0.61/0.85  (step t986 (cl (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= tptp.c 12)) (not (>= tptp.d 27)) (= (* tptp.d tptp.c) 286))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= tptp.c 12)) (not (>= tptp.d 27)) (= (* tptp.d tptp.c) 286))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= tptp.c 12)) (not (>= tptp.d 27)) (= (* tptp.d tptp.c) 286))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= tptp.c 12)) (not (>= tptp.d 27)) (= (* tptp.d tptp.c) 286))) (and (not (>= tptp.c 12)) (= (* tptp.d tptp.c) 286) (not (>= tptp.d 27)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule reordering :premises (t985))
% 0.61/0.85  (step t987 (cl (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= tptp.c 12)) (not (>= tptp.d 27)) (= (* tptp.d tptp.c) 286))) (and (not (>= tptp.c 12)) (= (* tptp.d tptp.c) 286) (not (>= tptp.d 27)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule contraction :premises (t986))
% 0.61/0.85  (step t988 (cl (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= tptp.c 12)) (not (>= tptp.d 27)) (= (* tptp.d tptp.c) 286)) (and (not (>= tptp.c 12)) (= (* tptp.d tptp.c) 286) (not (>= tptp.d 27)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (and (not (>= tptp.c 12)) (= (* tptp.d tptp.c) 286) (not (>= tptp.d 27)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule resolution :premises (t979 t987))
% 0.61/0.85  (step t989 (cl (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= tptp.c 12)) (not (>= tptp.d 27)) (= (* tptp.d tptp.c) 286)) (and (not (>= tptp.c 12)) (= (* tptp.d tptp.c) 286) (not (>= tptp.d 27)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (not (and (not (>= tptp.c 12)) (= (* tptp.d tptp.c) 286) (not (>= tptp.d 27)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)))) :rule implies_neg2)
% 0.61/0.85  (step t990 (cl (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= tptp.c 12)) (not (>= tptp.d 27)) (= (* tptp.d tptp.c) 286)) (and (not (>= tptp.c 12)) (= (* tptp.d tptp.c) 286) (not (>= tptp.d 27)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= tptp.c 12)) (not (>= tptp.d 27)) (= (* tptp.d tptp.c) 286)) (and (not (>= tptp.c 12)) (= (* tptp.d tptp.c) 286) (not (>= tptp.d 27)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)))) :rule resolution :premises (t988 t989))
% 0.61/0.85  (step t991 (cl (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= tptp.c 12)) (not (>= tptp.d 27)) (= (* tptp.d tptp.c) 286)) (and (not (>= tptp.c 12)) (= (* tptp.d tptp.c) 286) (not (>= tptp.d 27)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)))) :rule contraction :premises (t990))
% 0.61/0.85  (step t992 (cl (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= tptp.c 12)) (not (>= tptp.d 27)) (= (* tptp.d tptp.c) 286)))) :rule resolution :premises (t953 t978 t991))
% 0.61/0.85  (step t993 (cl (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= tptp.c 12))) (not (not (>= tptp.d 27))) (not (= (* tptp.d tptp.c) 286))) :rule not_and :premises (t992))
% 0.61/0.85  (step t994 (cl (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= tptp.c 12))) (not (not (>= tptp.d 27))) (not (= (* tptp.d tptp.c) 286))) (not (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)))) :rule or_neg)
% 0.61/0.85  (step t995 (cl (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= tptp.c 12))) (not (not (>= tptp.d 27))) (not (= (* tptp.d tptp.c) 286))) (not (not (not (>= tptp.c 12))))) :rule or_neg)
% 0.61/0.85  (step t996 (cl (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= tptp.c 12))) (not (not (>= tptp.d 27))) (not (= (* tptp.d tptp.c) 286))) (not (not (not (>= tptp.d 27))))) :rule or_neg)
% 0.61/0.85  (step t997 (cl (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= tptp.c 12))) (not (not (>= tptp.d 27))) (not (= (* tptp.d tptp.c) 286))) (not (not (= (* tptp.d tptp.c) 286)))) :rule or_neg)
% 0.61/0.85  (step t998 (cl (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= tptp.c 12))) (not (not (>= tptp.d 27))) (not (= (* tptp.d tptp.c) 286))) (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= tptp.c 12))) (not (not (>= tptp.d 27))) (not (= (* tptp.d tptp.c) 286))) (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= tptp.c 12))) (not (not (>= tptp.d 27))) (not (= (* tptp.d tptp.c) 286))) (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= tptp.c 12))) (not (not (>= tptp.d 27))) (not (= (* tptp.d tptp.c) 286)))) :rule resolution :premises (t993 t994 t995 t996 t997))
% 0.61/0.85  (step t999 (cl (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= tptp.c 12))) (not (not (>= tptp.d 27))) (not (= (* tptp.d tptp.c) 286)))) :rule contraction :premises (t998))
% 0.61/0.85  (step t1000 (cl (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (>= tptp.c 12) (>= tptp.d 27) (not (= (* tptp.d tptp.c) 286)))) :rule resolution :premises (t932 t952 t999))
% 0.61/0.85  (step t1001 (cl (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (>= tptp.c 12) (>= tptp.d 27) (not (= (* tptp.d tptp.c) 286))) :rule or :premises (t1000))
% 0.61/0.85  (step t1002 (cl (or (not (= tptp.c 11)) (not (= tptp.d 26)) (= (* tptp.d tptp.c) 286))) :rule hole :args ((or (not (= tptp.c 11)) (not (= tptp.d 26)) (= (* tptp.d tptp.c) 286)) 3))
% 0.61/0.85  (step t1003 (cl (not (= tptp.c 11)) (not (= tptp.d 26)) (= (* tptp.d tptp.c) 286)) :rule or :premises (t1002))
% 0.61/0.85  (step t1004 (cl (=> (= tptp.d 26) (not (>= tptp.d 27))) (= tptp.d 26)) :rule implies_neg1)
% 0.61/0.85  (anchor :step t1005)
% 0.61/0.85  (assume t1005.a0 (= tptp.d 26))
% 0.61/0.85  (step t1005.t1 (cl (=> (= tptp.d 26) (not (>= tptp.d 27))) (= tptp.d 26)) :rule implies_neg1)
% 0.61/0.85  (anchor :step t1005.t2)
% 0.61/0.85  (assume t1005.t2.a0 (= tptp.d 26))
% 0.61/0.85  (step t1005.t2.t1 (cl (not (= (< tptp.d 27) (not (>= tptp.d 27)))) (not (< tptp.d 27)) (not (>= tptp.d 27))) :rule equiv_pos2)
% 0.61/0.85  (step t1005.t2.t2 (cl (= (< tptp.d 27) (not (>= tptp.d 27)))) :rule all_simplify)
% 0.61/0.85  (step t1005.t2.t3 (cl (not (= (not (>= tptp.d 27)) (< tptp.d 27))) (not (not (>= tptp.d 27))) (< tptp.d 27)) :rule equiv_pos2)
% 0.61/0.85  (step t1005.t2.t4 (cl (= (not (>= tptp.d 27)) (< tptp.d 27))) :rule symm :premises (t1005.t2.t2))
% 0.61/0.85  (step t1005.t2.t5 (cl (=> (>= tptp.d 27) false) (>= tptp.d 27)) :rule implies_neg1)
% 0.61/0.85  (anchor :step t1005.t2.t6)
% 0.61/0.85  (assume t1005.t2.t6.a0 (>= tptp.d 27))
% 0.61/0.85  (step t1005.t2.t6.t1 (cl (not (= (<= (+ (* (- 1.0) tptp.d) (* 1.0 tptp.d)) (+ (* (- 1.0) 27) (* 1.0 26))) false)) (not (<= (+ (* (- 1.0) tptp.d) (* 1.0 tptp.d)) (+ (* (- 1.0) 27) (* 1.0 26)))) false) :rule equiv_pos2)
% 0.61/0.85  (step t1005.t2.t6.t2 (cl (= (* (- 1.0) tptp.d) (to_real (* (- 1) tptp.d)))) :rule all_simplify)
% 0.61/0.85  (step t1005.t2.t6.t3 (cl (= (* 1.0 tptp.d) (to_real tptp.d))) :rule all_simplify)
% 0.61/0.85  (step t1005.t2.t6.t4 (cl (= (+ (* (- 1.0) tptp.d) (* 1.0 tptp.d)) (+ (to_real (* (- 1) tptp.d)) (to_real tptp.d)))) :rule cong :premises (t1005.t2.t6.t2 t1005.t2.t6.t3))
% 0.61/0.85  (step t1005.t2.t6.t5 (cl (= (+ (to_real (* (- 1) tptp.d)) (to_real tptp.d)) 0.0)) :rule all_simplify)
% 0.61/0.85  (step t1005.t2.t6.t6 (cl (= (+ (* (- 1.0) tptp.d) (* 1.0 tptp.d)) 0.0)) :rule trans :premises (t1005.t2.t6.t4 t1005.t2.t6.t5))
% 0.61/0.85  (step t1005.t2.t6.t7 (cl (= (* (- 1.0) 27) (- 27.0))) :rule all_simplify)
% 0.61/0.85  (step t1005.t2.t6.t8 (cl (= (* 1.0 26) 26.0)) :rule all_simplify)
% 0.61/0.85  (step t1005.t2.t6.t9 (cl (= (+ (* (- 1.0) 27) (* 1.0 26)) (+ (- 27.0) 26.0))) :rule cong :premises (t1005.t2.t6.t7 t1005.t2.t6.t8))
% 0.61/0.85  (step t1005.t2.t6.t10 (cl (= (+ (- 27.0) 26.0) (- 1.0))) :rule all_simplify)
% 0.61/0.85  (step t1005.t2.t6.t11 (cl (= (+ (* (- 1.0) 27) (* 1.0 26)) (- 1.0))) :rule trans :premises (t1005.t2.t6.t9 t1005.t2.t6.t10))
% 0.61/0.85  (step t1005.t2.t6.t12 (cl (= (<= (+ (* (- 1.0) tptp.d) (* 1.0 tptp.d)) (+ (* (- 1.0) 27) (* 1.0 26))) (<= 0.0 (- 1.0)))) :rule cong :premises (t1005.t2.t6.t6 t1005.t2.t6.t11))
% 0.61/0.85  (step t1005.t2.t6.t13 (cl (= (<= 0.0 (- 1.0)) false)) :rule all_simplify)
% 0.61/0.85  (step t1005.t2.t6.t14 (cl (= (<= (+ (* (- 1.0) tptp.d) (* 1.0 tptp.d)) (+ (* (- 1.0) 27) (* 1.0 26))) false)) :rule trans :premises (t1005.t2.t6.t12 t1005.t2.t6.t13))
% 0.61/0.85  (step t1005.t2.t6.t15 (cl (not (<= (* (- 1.0) tptp.d) (* (- 1.0) 27))) (not (= (* 1.0 tptp.d) (* 1.0 26))) (<= (+ (* (- 1.0) tptp.d) (* 1.0 tptp.d)) (+ (* (- 1.0) 27) (* 1.0 26)))) :rule la_generic :args (1 (- 1) 1))
% 0.61/0.85  (step t1005.t2.t6.t16 (cl (=> (and (< (- 1.0) 0) (>= tptp.d 27)) (<= (* (- 1.0) tptp.d) (* (- 1.0) 27)))) :rule la_mult_neg)
% 0.61/0.85  (step t1005.t2.t6.t17 (cl (not (and (< (- 1.0) 0) (>= tptp.d 27))) (<= (* (- 1.0) tptp.d) (* (- 1.0) 27))) :rule implies :premises (t1005.t2.t6.t16))
% 0.61/0.85  (step t1005.t2.t6.t18 (cl (and (< (- 1.0) 0) (>= tptp.d 27)) (not (< (- 1.0) 0)) (not (>= tptp.d 27))) :rule and_neg)
% 0.61/0.85  (step t1005.t2.t6.t19 (cl (= (= (< (- 1.0) 0) true) (< (- 1.0) 0))) :rule equiv_simplify)
% 0.61/0.85  (step t1005.t2.t6.t20 (cl (not (= (< (- 1.0) 0) true)) (< (- 1.0) 0)) :rule equiv1 :premises (t1005.t2.t6.t19))
% 0.61/0.85  (step t1005.t2.t6.t21 (cl (= (< (- 1.0) 0) true)) :rule hole :args ((< (- 1.0) 0)))
% 0.61/0.85  (step t1005.t2.t6.t22 (cl (< (- 1.0) 0)) :rule resolution :premises (t1005.t2.t6.t20 t1005.t2.t6.t21))
% 0.61/0.85  (step t1005.t2.t6.t23 (cl (and (< (- 1.0) 0) (>= tptp.d 27))) :rule resolution :premises (t1005.t2.t6.t18 t1005.t2.t6.t22 t1005.t2.t6.a0))
% 0.61/0.85  (step t1005.t2.t6.t24 (cl (<= (* (- 1.0) tptp.d) (* (- 1.0) 27))) :rule resolution :premises (t1005.t2.t6.t17 t1005.t2.t6.t23))
% 0.61/0.85  (step t1005.t2.t6.t25 (cl (=> (and (> 1.0 0) (= tptp.d 26)) (= (* 1.0 tptp.d) (* 1.0 26)))) :rule la_mult_pos)
% 0.61/0.85  (step t1005.t2.t6.t26 (cl (not (and (> 1.0 0) (= tptp.d 26))) (= (* 1.0 tptp.d) (* 1.0 26))) :rule implies :premises (t1005.t2.t6.t25))
% 0.61/0.85  (step t1005.t2.t6.t27 (cl (and (> 1.0 0) (= tptp.d 26)) (not (> 1.0 0)) (not (= tptp.d 26))) :rule and_neg)
% 0.61/0.85  (step t1005.t2.t6.t28 (cl (= (= (> 1.0 0) true) (> 1.0 0))) :rule equiv_simplify)
% 0.61/0.85  (step t1005.t2.t6.t29 (cl (not (= (> 1.0 0) true)) (> 1.0 0)) :rule equiv1 :premises (t1005.t2.t6.t28))
% 0.61/0.85  (step t1005.t2.t6.t30 (cl (= (> 1.0 0) true)) :rule hole :args ((> 1.0 0)))
% 0.61/0.85  (step t1005.t2.t6.t31 (cl (> 1.0 0)) :rule resolution :premises (t1005.t2.t6.t29 t1005.t2.t6.t30))
% 0.61/0.85  (step t1005.t2.t6.t32 (cl (and (> 1.0 0) (= tptp.d 26))) :rule resolution :premises (t1005.t2.t6.t27 t1005.t2.t6.t31 t1005.t2.a0))
% 0.61/0.85  (step t1005.t2.t6.t33 (cl (= (* 1.0 tptp.d) (* 1.0 26))) :rule resolution :premises (t1005.t2.t6.t26 t1005.t2.t6.t32))
% 0.61/0.85  (step t1005.t2.t6.t34 (cl (<= (+ (* (- 1.0) tptp.d) (* 1.0 tptp.d)) (+ (* (- 1.0) 27) (* 1.0 26)))) :rule resolution :premises (t1005.t2.t6.t15 t1005.t2.t6.t24 t1005.t2.t6.t33))
% 0.61/0.85  (step t1005.t2.t6.t35 (cl false) :rule resolution :premises (t1005.t2.t6.t1 t1005.t2.t6.t14 t1005.t2.t6.t34))
% 0.61/0.85  (step t1005.t2.t6 (cl (not (>= tptp.d 27)) false) :rule subproof :discharge (t1005.t2.t6.a0))
% 0.61/0.85  (step t1005.t2.t7 (cl (=> (>= tptp.d 27) false) false) :rule resolution :premises (t1005.t2.t5 t1005.t2.t6))
% 0.61/0.85  (step t1005.t2.t8 (cl (=> (>= tptp.d 27) false) (not false)) :rule implies_neg2)
% 0.61/0.85  (step t1005.t2.t9 (cl (=> (>= tptp.d 27) false) (=> (>= tptp.d 27) false)) :rule resolution :premises (t1005.t2.t7 t1005.t2.t8))
% 0.61/0.85  (step t1005.t2.t10 (cl (=> (>= tptp.d 27) false)) :rule contraction :premises (t1005.t2.t9))
% 0.61/0.85  (step t1005.t2.t11 (cl (= (=> (>= tptp.d 27) false) (not (>= tptp.d 27)))) :rule implies_simplify)
% 0.61/0.85  (step t1005.t2.t12 (cl (not (=> (>= tptp.d 27) false)) (not (>= tptp.d 27))) :rule equiv1 :premises (t1005.t2.t11))
% 0.61/0.85  (step t1005.t2.t13 (cl (not (>= tptp.d 27))) :rule resolution :premises (t1005.t2.t10 t1005.t2.t12))
% 0.61/0.85  (step t1005.t2.t14 (cl (< tptp.d 27)) :rule resolution :premises (t1005.t2.t3 t1005.t2.t4 t1005.t2.t13))
% 0.61/0.85  (step t1005.t2.t15 (cl (not (>= tptp.d 27))) :rule resolution :premises (t1005.t2.t1 t1005.t2.t2 t1005.t2.t14))
% 0.61/0.85  (step t1005.t2 (cl (not (= tptp.d 26)) (not (>= tptp.d 27))) :rule subproof :discharge (t1005.t2.a0))
% 0.61/0.85  (step t1005.t3 (cl (=> (= tptp.d 26) (not (>= tptp.d 27))) (not (>= tptp.d 27))) :rule resolution :premises (t1005.t1 t1005.t2))
% 0.61/0.85  (step t1005.t4 (cl (=> (= tptp.d 26) (not (>= tptp.d 27))) (not (not (>= tptp.d 27)))) :rule implies_neg2)
% 0.61/0.85  (step t1005.t5 (cl (=> (= tptp.d 26) (not (>= tptp.d 27))) (=> (= tptp.d 26) (not (>= tptp.d 27)))) :rule resolution :premises (t1005.t3 t1005.t4))
% 0.61/0.85  (step t1005.t6 (cl (=> (= tptp.d 26) (not (>= tptp.d 27)))) :rule contraction :premises (t1005.t5))
% 0.61/0.85  (step t1005.t7 (cl (not (= tptp.d 26)) (not (>= tptp.d 27))) :rule implies :premises (t1005.t6))
% 0.61/0.85  (step t1005.t8 (cl (not (>= tptp.d 27))) :rule resolution :premises (t1005.t7 t1005.a0))
% 0.61/0.85  (step t1005 (cl (not (= tptp.d 26)) (not (>= tptp.d 27))) :rule subproof :discharge (t1005.a0))
% 0.61/0.85  (step t1006 (cl (=> (= tptp.d 26) (not (>= tptp.d 27))) (not (>= tptp.d 27))) :rule resolution :premises (t1004 t1005))
% 0.61/0.85  (step t1007 (cl (=> (= tptp.d 26) (not (>= tptp.d 27))) (not (not (>= tptp.d 27)))) :rule implies_neg2)
% 0.61/0.85  (step t1008 (cl (=> (= tptp.d 26) (not (>= tptp.d 27))) (=> (= tptp.d 26) (not (>= tptp.d 27)))) :rule resolution :premises (t1006 t1007))
% 0.61/0.85  (step t1009 (cl (=> (= tptp.d 26) (not (>= tptp.d 27)))) :rule contraction :premises (t1008))
% 0.61/0.85  (step t1010 (cl (not (= tptp.d 26)) (not (>= tptp.d 27))) :rule implies :premises (t1009))
% 0.61/0.85  (step t1011 (cl (=> (= tptp.c 11) (not (>= tptp.c 12))) (= tptp.c 11)) :rule implies_neg1)
% 0.61/0.85  (anchor :step t1012)
% 0.61/0.85  (assume t1012.a0 (= tptp.c 11))
% 0.61/0.85  (step t1012.t1 (cl (=> (= tptp.c 11) (not (>= tptp.c 12))) (= tptp.c 11)) :rule implies_neg1)
% 0.61/0.85  (anchor :step t1012.t2)
% 0.61/0.85  (assume t1012.t2.a0 (= tptp.c 11))
% 0.61/0.85  (step t1012.t2.t1 (cl (not (= (< tptp.c 12) (not (>= tptp.c 12)))) (not (< tptp.c 12)) (not (>= tptp.c 12))) :rule equiv_pos2)
% 0.61/0.85  (step t1012.t2.t2 (cl (= (< tptp.c 12) (not (>= tptp.c 12)))) :rule all_simplify)
% 0.61/0.85  (step t1012.t2.t3 (cl (not (= (not (>= tptp.c 12)) (< tptp.c 12))) (not (not (>= tptp.c 12))) (< tptp.c 12)) :rule equiv_pos2)
% 0.61/0.85  (step t1012.t2.t4 (cl (= (not (>= tptp.c 12)) (< tptp.c 12))) :rule symm :premises (t1012.t2.t2))
% 0.61/0.85  (step t1012.t2.t5 (cl (=> (>= tptp.c 12) false) (>= tptp.c 12)) :rule implies_neg1)
% 0.61/0.85  (anchor :step t1012.t2.t6)
% 0.61/0.85  (assume t1012.t2.t6.a0 (>= tptp.c 12))
% 0.61/0.85  (step t1012.t2.t6.t1 (cl (not (= (<= (+ (* (- 1.0) tptp.c) (* 1.0 tptp.c)) (+ (* (- 1.0) 12) (* 1.0 11))) false)) (not (<= (+ (* (- 1.0) tptp.c) (* 1.0 tptp.c)) (+ (* (- 1.0) 12) (* 1.0 11)))) false) :rule equiv_pos2)
% 0.61/0.85  (step t1012.t2.t6.t2 (cl (= (* (- 1.0) tptp.c) (to_real (* (- 1) tptp.c)))) :rule all_simplify)
% 0.61/0.85  (step t1012.t2.t6.t3 (cl (= (* 1.0 tptp.c) (to_real tptp.c))) :rule all_simplify)
% 0.61/0.85  (step t1012.t2.t6.t4 (cl (= (+ (* (- 1.0) tptp.c) (* 1.0 tptp.c)) (+ (to_real (* (- 1) tptp.c)) (to_real tptp.c)))) :rule cong :premises (t1012.t2.t6.t2 t1012.t2.t6.t3))
% 0.61/0.85  (step t1012.t2.t6.t5 (cl (= (+ (to_real (* (- 1) tptp.c)) (to_real tptp.c)) 0.0)) :rule all_simplify)
% 0.61/0.85  (step t1012.t2.t6.t6 (cl (= (+ (* (- 1.0) tptp.c) (* 1.0 tptp.c)) 0.0)) :rule trans :premises (t1012.t2.t6.t4 t1012.t2.t6.t5))
% 0.61/0.85  (step t1012.t2.t6.t7 (cl (= (* (- 1.0) 12) (- 12.0))) :rule all_simplify)
% 0.61/0.85  (step t1012.t2.t6.t8 (cl (= (* 1.0 11) 11.0)) :rule all_simplify)
% 0.61/0.85  (step t1012.t2.t6.t9 (cl (= (+ (* (- 1.0) 12) (* 1.0 11)) (+ (- 12.0) 11.0))) :rule cong :premises (t1012.t2.t6.t7 t1012.t2.t6.t8))
% 0.61/0.85  (step t1012.t2.t6.t10 (cl (= (+ (- 12.0) 11.0) (- 1.0))) :rule all_simplify)
% 0.61/0.85  (step t1012.t2.t6.t11 (cl (= (+ (* (- 1.0) 12) (* 1.0 11)) (- 1.0))) :rule trans :premises (t1012.t2.t6.t9 t1012.t2.t6.t10))
% 0.61/0.85  (step t1012.t2.t6.t12 (cl (= (<= (+ (* (- 1.0) tptp.c) (* 1.0 tptp.c)) (+ (* (- 1.0) 12) (* 1.0 11))) (<= 0.0 (- 1.0)))) :rule cong :premises (t1012.t2.t6.t6 t1012.t2.t6.t11))
% 0.61/0.85  (step t1012.t2.t6.t13 (cl (= (<= 0.0 (- 1.0)) false)) :rule all_simplify)
% 0.61/0.85  (step t1012.t2.t6.t14 (cl (= (<= (+ (* (- 1.0) tptp.c) (* 1.0 tptp.c)) (+ (* (- 1.0) 12) (* 1.0 11))) false)) :rule trans :premises (t1012.t2.t6.t12 t1012.t2.t6.t13))
% 0.61/0.85  (step t1012.t2.t6.t15 (cl (not (<= (* (- 1.0) tptp.c) (* (- 1.0) 12))) (not (= (* 1.0 tptp.c) (* 1.0 11))) (<= (+ (* (- 1.0) tptp.c) (* 1.0 tptp.c)) (+ (* (- 1.0) 12) (* 1.0 11)))) :rule la_generic :args (1 (- 1) 1))
% 0.61/0.85  (step t1012.t2.t6.t16 (cl (=> (and (< (- 1.0) 0) (>= tptp.c 12)) (<= (* (- 1.0) tptp.c) (* (- 1.0) 12)))) :rule la_mult_neg)
% 0.61/0.85  (step t1012.t2.t6.t17 (cl (not (and (< (- 1.0) 0) (>= tptp.c 12))) (<= (* (- 1.0) tptp.c) (* (- 1.0) 12))) :rule implies :premises (t1012.t2.t6.t16))
% 0.61/0.85  (step t1012.t2.t6.t18 (cl (and (< (- 1.0) 0) (>= tptp.c 12)) (not (< (- 1.0) 0)) (not (>= tptp.c 12))) :rule and_neg)
% 0.61/0.85  (step t1012.t2.t6.t19 (cl (= (= (< (- 1.0) 0) true) (< (- 1.0) 0))) :rule equiv_simplify)
% 0.61/0.85  (step t1012.t2.t6.t20 (cl (not (= (< (- 1.0) 0) true)) (< (- 1.0) 0)) :rule equiv1 :premises (t1012.t2.t6.t19))
% 0.61/0.85  (step t1012.t2.t6.t21 (cl (= (< (- 1.0) 0) true)) :rule hole :args ((< (- 1.0) 0)))
% 0.61/0.85  (step t1012.t2.t6.t22 (cl (< (- 1.0) 0)) :rule resolution :premises (t1012.t2.t6.t20 t1012.t2.t6.t21))
% 0.61/0.85  (step t1012.t2.t6.t23 (cl (and (< (- 1.0) 0) (>= tptp.c 12))) :rule resolution :premises (t1012.t2.t6.t18 t1012.t2.t6.t22 t1012.t2.t6.a0))
% 0.61/0.85  (step t1012.t2.t6.t24 (cl (<= (* (- 1.0) tptp.c) (* (- 1.0) 12))) :rule resolution :premises (t1012.t2.t6.t17 t1012.t2.t6.t23))
% 0.61/0.85  (step t1012.t2.t6.t25 (cl (=> (and (> 1.0 0) (= tptp.c 11)) (= (* 1.0 tptp.c) (* 1.0 11)))) :rule la_mult_pos)
% 0.61/0.85  (step t1012.t2.t6.t26 (cl (not (and (> 1.0 0) (= tptp.c 11))) (= (* 1.0 tptp.c) (* 1.0 11))) :rule implies :premises (t1012.t2.t6.t25))
% 0.61/0.85  (step t1012.t2.t6.t27 (cl (and (> 1.0 0) (= tptp.c 11)) (not (> 1.0 0)) (not (= tptp.c 11))) :rule and_neg)
% 0.61/0.85  (step t1012.t2.t6.t28 (cl (= (= (> 1.0 0) true) (> 1.0 0))) :rule equiv_simplify)
% 0.61/0.85  (step t1012.t2.t6.t29 (cl (not (= (> 1.0 0) true)) (> 1.0 0)) :rule equiv1 :premises (t1012.t2.t6.t28))
% 0.61/0.85  (step t1012.t2.t6.t30 (cl (= (> 1.0 0) true)) :rule hole :args ((> 1.0 0)))
% 0.61/0.85  (step t1012.t2.t6.t31 (cl (> 1.0 0)) :rule resolution :premises (t1012.t2.t6.t29 t1012.t2.t6.t30))
% 0.61/0.85  (step t1012.t2.t6.t32 (cl (and (> 1.0 0) (= tptp.c 11))) :rule resolution :premises (t1012.t2.t6.t27 t1012.t2.t6.t31 t1012.t2.a0))
% 0.61/0.85  (step t1012.t2.t6.t33 (cl (= (* 1.0 tptp.c) (* 1.0 11))) :rule resolution :premises (t1012.t2.t6.t26 t1012.t2.t6.t32))
% 0.61/0.85  (step t1012.t2.t6.t34 (cl (<= (+ (* (- 1.0) tptp.c) (* 1.0 tptp.c)) (+ (* (- 1.0) 12) (* 1.0 11)))) :rule resolution :premises (t1012.t2.t6.t15 t1012.t2.t6.t24 t1012.t2.t6.t33))
% 0.61/0.85  (step t1012.t2.t6.t35 (cl false) :rule resolution :premises (t1012.t2.t6.t1 t1012.t2.t6.t14 t1012.t2.t6.t34))
% 0.61/0.85  (step t1012.t2.t6 (cl (not (>= tptp.c 12)) false) :rule subproof :discharge (t1012.t2.t6.a0))
% 0.61/0.85  (step t1012.t2.t7 (cl (=> (>= tptp.c 12) false) false) :rule resolution :premises (t1012.t2.t5 t1012.t2.t6))
% 0.61/0.85  (step t1012.t2.t8 (cl (=> (>= tptp.c 12) false) (not false)) :rule implies_neg2)
% 0.61/0.85  (step t1012.t2.t9 (cl (=> (>= tptp.c 12) false) (=> (>= tptp.c 12) false)) :rule resolution :premises (t1012.t2.t7 t1012.t2.t8))
% 0.61/0.85  (step t1012.t2.t10 (cl (=> (>= tptp.c 12) false)) :rule contraction :premises (t1012.t2.t9))
% 0.61/0.85  (step t1012.t2.t11 (cl (= (=> (>= tptp.c 12) false) (not (>= tptp.c 12)))) :rule implies_simplify)
% 0.61/0.85  (step t1012.t2.t12 (cl (not (=> (>= tptp.c 12) false)) (not (>= tptp.c 12))) :rule equiv1 :premises (t1012.t2.t11))
% 0.61/0.85  (step t1012.t2.t13 (cl (not (>= tptp.c 12))) :rule resolution :premises (t1012.t2.t10 t1012.t2.t12))
% 0.61/0.85  (step t1012.t2.t14 (cl (< tptp.c 12)) :rule resolution :premises (t1012.t2.t3 t1012.t2.t4 t1012.t2.t13))
% 0.61/0.85  (step t1012.t2.t15 (cl (not (>= tptp.c 12))) :rule resolution :premises (t1012.t2.t1 t1012.t2.t2 t1012.t2.t14))
% 0.61/0.85  (step t1012.t2 (cl (not (= tptp.c 11)) (not (>= tptp.c 12))) :rule subproof :discharge (t1012.t2.a0))
% 0.61/0.85  (step t1012.t3 (cl (=> (= tptp.c 11) (not (>= tptp.c 12))) (not (>= tptp.c 12))) :rule resolution :premises (t1012.t1 t1012.t2))
% 0.61/0.85  (step t1012.t4 (cl (=> (= tptp.c 11) (not (>= tptp.c 12))) (not (not (>= tptp.c 12)))) :rule implies_neg2)
% 0.61/0.85  (step t1012.t5 (cl (=> (= tptp.c 11) (not (>= tptp.c 12))) (=> (= tptp.c 11) (not (>= tptp.c 12)))) :rule resolution :premises (t1012.t3 t1012.t4))
% 0.61/0.85  (step t1012.t6 (cl (=> (= tptp.c 11) (not (>= tptp.c 12)))) :rule contraction :premises (t1012.t5))
% 0.61/0.85  (step t1012.t7 (cl (not (= tptp.c 11)) (not (>= tptp.c 12))) :rule implies :premises (t1012.t6))
% 0.61/0.85  (step t1012.t8 (cl (not (>= tptp.c 12))) :rule resolution :premises (t1012.t7 t1012.a0))
% 0.61/0.85  (step t1012 (cl (not (= tptp.c 11)) (not (>= tptp.c 12))) :rule subproof :discharge (t1012.a0))
% 0.61/0.85  (step t1013 (cl (=> (= tptp.c 11) (not (>= tptp.c 12))) (not (>= tptp.c 12))) :rule resolution :premises (t1011 t1012))
% 0.61/0.85  (step t1014 (cl (=> (= tptp.c 11) (not (>= tptp.c 12))) (not (not (>= tptp.c 12)))) :rule implies_neg2)
% 0.61/0.85  (step t1015 (cl (=> (= tptp.c 11) (not (>= tptp.c 12))) (=> (= tptp.c 11) (not (>= tptp.c 12)))) :rule resolution :premises (t1013 t1014))
% 0.61/0.85  (step t1016 (cl (=> (= tptp.c 11) (not (>= tptp.c 12)))) :rule contraction :premises (t1015))
% 0.61/0.85  (step t1017 (cl (not (= tptp.c 11)) (not (>= tptp.c 12))) :rule implies :premises (t1016))
% 0.61/0.85  (step t1018 (cl (not (= tptp.c 11)) (not (= tptp.d 26)) (not (= tptp.d 26)) (not (= tptp.c 11))) :rule resolution :premises (t1001 t202 t1003 t1010 t1017))
% 0.61/0.85  (step t1019 (cl (not (= tptp.c 11)) (not (= tptp.d 26))) :rule contraction :premises (t1018))
% 0.61/0.85  (step t1020 (cl (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1) (not (= tptp.c 11)) (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1) (not (= tptp.c 11)) (not (= tptp.c 11))) :rule resolution :premises (t835 t202 t879 t931 t202 t1019))
% 0.61/0.85  (step t1021 (cl (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1) (not (= tptp.c 11)) (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) :rule contraction :premises (t1020))
% 0.61/0.85  (step t1022 (cl (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1) (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1) (not (= tptp.c 11))) :rule reordering :premises (t1021))
% 0.61/0.85  (step t1023 (cl (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1) (not (>= tptp.d 1)) (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1) (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1) (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1) (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) :rule resolution :premises (t577 t633 t202 t658 t660 t702 t773 t202 t1022))
% 0.61/0.85  (step t1024 (cl (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1) (not (>= tptp.d 1)) (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) :rule contraction :premises (t1023))
% 0.61/0.85  (step t1025 (cl (not (= (=> (and (> tptp.c 0) (>= tptp.d 7)) (>= (* tptp.c tptp.d) (* tptp.c (* (- 1) (- 7))))) (=> (and (>= tptp.c 1) (>= tptp.d 7)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))))) (not (=> (and (> tptp.c 0) (>= tptp.d 7)) (>= (* tptp.c tptp.d) (* tptp.c (* (- 1) (- 7)))))) (=> (and (>= tptp.c 1) (>= tptp.d 7)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)))) :rule equiv_pos2)
% 0.61/0.85  (step t1026 (cl (= (> tptp.c 0) (not (<= tptp.c 0)))) :rule all_simplify)
% 0.61/0.85  (step t1027 (cl (= (<= tptp.c 0) (not (>= tptp.c 1)))) :rule all_simplify)
% 0.61/0.85  (step t1028 (cl (= (not (<= tptp.c 0)) (not (not (>= tptp.c 1))))) :rule cong :premises (t1027))
% 0.61/0.85  (step t1029 (cl (= (not (<= tptp.c 0)) (>= tptp.c 1))) :rule trans :premises (t1028 t583))
% 0.61/0.85  (step t1030 (cl (= (> tptp.c 0) (>= tptp.c 1))) :rule trans :premises (t1026 t1029))
% 0.61/0.85  (step t1031 (cl (= (>= tptp.d 7) (>= tptp.d 7))) :rule refl)
% 0.61/0.85  (step t1032 (cl (= (and (> tptp.c 0) (>= tptp.d 7)) (and (>= tptp.c 1) (>= tptp.d 7)))) :rule cong :premises (t1030 t1031))
% 0.61/0.85  (step t1033 (cl (= (* (- 1) (- 7)) 7)) :rule all_simplify)
% 0.61/0.85  (step t1034 (cl (= (* tptp.c (* (- 1) (- 7))) (* tptp.c 7))) :rule cong :premises (t135 t1033))
% 0.61/0.85  (step t1035 (cl (= (* tptp.c 7) (* 7 tptp.c))) :rule all_simplify)
% 0.61/0.85  (step t1036 (cl (= (* tptp.c (* (- 1) (- 7))) (* 7 tptp.c))) :rule trans :premises (t1034 t1035))
% 0.61/0.85  (step t1037 (cl (= (>= (* tptp.c tptp.d) (* tptp.c (* (- 1) (- 7)))) (>= (* tptp.d tptp.c) (* 7 tptp.c)))) :rule cong :premises (t120 t1036))
% 0.61/0.85  (step t1038 (cl (= (>= (* tptp.d tptp.c) (* 7 tptp.c)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)))) :rule all_simplify)
% 0.61/0.85  (step t1039 (cl (= (>= (* tptp.c tptp.d) (* tptp.c (* (- 1) (- 7)))) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)))) :rule trans :premises (t1037 t1038))
% 0.61/0.85  (step t1040 (cl (= (=> (and (> tptp.c 0) (>= tptp.d 7)) (>= (* tptp.c tptp.d) (* tptp.c (* (- 1) (- 7))))) (=> (and (>= tptp.c 1) (>= tptp.d 7)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))))) :rule cong :premises (t1032 t1039))
% 0.61/0.85  (step t1041 (cl (not (= (=> (and (> tptp.c 0) (>= tptp.d (* (- 1) (- 7)))) (>= (* tptp.c tptp.d) (* tptp.c (* (- 1) (- 7))))) (=> (and (> tptp.c 0) (>= tptp.d 7)) (>= (* tptp.c tptp.d) (* tptp.c (* (- 1) (- 7))))))) (not (=> (and (> tptp.c 0) (>= tptp.d (* (- 1) (- 7)))) (>= (* tptp.c tptp.d) (* tptp.c (* (- 1) (- 7)))))) (=> (and (> tptp.c 0) (>= tptp.d 7)) (>= (* tptp.c tptp.d) (* tptp.c (* (- 1) (- 7)))))) :rule equiv_pos2)
% 0.61/0.85  (step t1042 (cl (= (>= tptp.d (* (- 1) (- 7))) (>= tptp.d 7))) :rule cong :premises (t126 t1033))
% 0.61/0.85  (step t1043 (cl (= (and (> tptp.c 0) (>= tptp.d (* (- 1) (- 7)))) (and (>= tptp.c 1) (>= tptp.d 7)))) :rule cong :premises (t1030 t1042))
% 0.61/0.85  (step t1044 (cl (= (=> (and (> tptp.c 0) (>= tptp.d (* (- 1) (- 7)))) (>= (* tptp.c tptp.d) (* tptp.c (* (- 1) (- 7))))) (=> (and (>= tptp.c 1) (>= tptp.d 7)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))))) :rule cong :premises (t1043 t1039))
% 0.61/0.85  (step t1045 (cl (= (=> (and (> tptp.c 0) (>= tptp.d 7)) (>= (* tptp.c tptp.d) (* tptp.c (* (- 1) (- 7))))) (=> (and (>= tptp.c 1) (>= tptp.d 7)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))))) :rule cong :premises (t1032 t1039))
% 0.61/0.85  (step t1046 (cl (= (=> (and (>= tptp.c 1) (>= tptp.d 7)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (=> (and (> tptp.c 0) (>= tptp.d 7)) (>= (* tptp.c tptp.d) (* tptp.c (* (- 1) (- 7))))))) :rule symm :premises (t1045))
% 0.61/0.85  (step t1047 (cl (= (=> (and (> tptp.c 0) (>= tptp.d (* (- 1) (- 7)))) (>= (* tptp.c tptp.d) (* tptp.c (* (- 1) (- 7))))) (=> (and (> tptp.c 0) (>= tptp.d 7)) (>= (* tptp.c tptp.d) (* tptp.c (* (- 1) (- 7))))))) :rule trans :premises (t1044 t1046))
% 0.61/0.85  (step t1048 (cl (=> (and (> tptp.c 0) (>= tptp.d (* (- 1) (- 7)))) (>= (* tptp.c tptp.d) (* tptp.c (* (- 1) (- 7)))))) :rule la_mult_pos)
% 0.61/0.85  (step t1049 (cl (=> (and (> tptp.c 0) (>= tptp.d 7)) (>= (* tptp.c tptp.d) (* tptp.c (* (- 1) (- 7)))))) :rule resolution :premises (t1041 t1047 t1048))
% 0.61/0.85  (step t1050 (cl (=> (and (>= tptp.c 1) (>= tptp.d 7)) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)))) :rule resolution :premises (t1025 t1040 t1049))
% 0.61/0.85  (step t1051 (cl (not (and (>= tptp.c 1) (>= tptp.d 7))) (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) :rule implies :premises (t1050))
% 0.61/0.85  (step t1052 (cl (not (>= (+ (* 7 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (and (>= tptp.c 1) (>= tptp.d 7)))) :rule reordering :premises (t1051))
% 0.61/0.85  (step t1053 (cl (not (= (=> (and (> tptp.d 0) (>= tptp.c 3)) (>= (* tptp.d tptp.c) (* tptp.d (* (- 1) (- 3))))) (=> (and (>= tptp.d 1) (>= tptp.c 3)) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))))) (not (=> (and (> tptp.d 0) (>= tptp.c 3)) (>= (* tptp.d tptp.c) (* tptp.d (* (- 1) (- 3)))))) (=> (and (>= tptp.d 1) (>= tptp.c 3)) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)))) :rule equiv_pos2)
% 0.61/0.85  (step t1054 (cl (= (>= tptp.c 3) (>= tptp.c 3))) :rule refl)
% 0.61/0.85  (step t1055 (cl (= (and (> tptp.d 0) (>= tptp.c 3)) (and (>= tptp.d 1) (>= tptp.c 3)))) :rule cong :premises (t209 t1054))
% 0.61/0.85  (step t1056 (cl (= (* (- 1) (- 3)) 3)) :rule all_simplify)
% 0.61/0.85  (step t1057 (cl (= (* tptp.d (* (- 1) (- 3))) (* tptp.d 3))) :rule cong :premises (t126 t1056))
% 0.61/0.85  (step t1058 (cl (= (* tptp.d 3) (* 3 tptp.d))) :rule all_simplify)
% 0.61/0.85  (step t1059 (cl (= (* tptp.d (* (- 1) (- 3))) (* 3 tptp.d))) :rule trans :premises (t1057 t1058))
% 0.61/0.85  (step t1060 (cl (= (>= (* tptp.d tptp.c) (* tptp.d (* (- 1) (- 3)))) (>= (* tptp.d tptp.c) (* 3 tptp.d)))) :rule cong :premises (t212 t1059))
% 0.61/0.85  (step t1061 (cl (= (>= (* tptp.d tptp.c) (* 3 tptp.d)) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)))) :rule all_simplify)
% 0.61/0.85  (step t1062 (cl (= (>= (* tptp.d tptp.c) (* tptp.d (* (- 1) (- 3)))) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)))) :rule trans :premises (t1060 t1061))
% 0.61/0.85  (step t1063 (cl (= (=> (and (> tptp.d 0) (>= tptp.c 3)) (>= (* tptp.d tptp.c) (* tptp.d (* (- 1) (- 3))))) (=> (and (>= tptp.d 1) (>= tptp.c 3)) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))))) :rule cong :premises (t1055 t1062))
% 0.61/0.85  (step t1064 (cl (not (= (=> (and (> tptp.d 0) (>= tptp.c (* (- 1) (- 3)))) (>= (* tptp.d tptp.c) (* tptp.d (* (- 1) (- 3))))) (=> (and (> tptp.d 0) (>= tptp.c 3)) (>= (* tptp.d tptp.c) (* tptp.d (* (- 1) (- 3))))))) (not (=> (and (> tptp.d 0) (>= tptp.c (* (- 1) (- 3)))) (>= (* tptp.d tptp.c) (* tptp.d (* (- 1) (- 3)))))) (=> (and (> tptp.d 0) (>= tptp.c 3)) (>= (* tptp.d tptp.c) (* tptp.d (* (- 1) (- 3)))))) :rule equiv_pos2)
% 0.61/0.85  (step t1065 (cl (= (>= tptp.c (* (- 1) (- 3))) (>= tptp.c 3))) :rule cong :premises (t135 t1056))
% 0.61/0.85  (step t1066 (cl (= (and (> tptp.d 0) (>= tptp.c (* (- 1) (- 3)))) (and (>= tptp.d 1) (>= tptp.c 3)))) :rule cong :premises (t209 t1065))
% 0.61/0.85  (step t1067 (cl (= (=> (and (> tptp.d 0) (>= tptp.c (* (- 1) (- 3)))) (>= (* tptp.d tptp.c) (* tptp.d (* (- 1) (- 3))))) (=> (and (>= tptp.d 1) (>= tptp.c 3)) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))))) :rule cong :premises (t1066 t1062))
% 0.61/0.85  (step t1068 (cl (= (=> (and (> tptp.d 0) (>= tptp.c 3)) (>= (* tptp.d tptp.c) (* tptp.d (* (- 1) (- 3))))) (=> (and (>= tptp.d 1) (>= tptp.c 3)) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))))) :rule cong :premises (t1055 t1062))
% 0.61/0.85  (step t1069 (cl (= (=> (and (>= tptp.d 1) (>= tptp.c 3)) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) (=> (and (> tptp.d 0) (>= tptp.c 3)) (>= (* tptp.d tptp.c) (* tptp.d (* (- 1) (- 3))))))) :rule symm :premises (t1068))
% 0.61/0.85  (step t1070 (cl (= (=> (and (> tptp.d 0) (>= tptp.c (* (- 1) (- 3)))) (>= (* tptp.d tptp.c) (* tptp.d (* (- 1) (- 3))))) (=> (and (> tptp.d 0) (>= tptp.c 3)) (>= (* tptp.d tptp.c) (* tptp.d (* (- 1) (- 3))))))) :rule trans :premises (t1067 t1069))
% 0.61/0.85  (step t1071 (cl (=> (and (> tptp.d 0) (>= tptp.c (* (- 1) (- 3)))) (>= (* tptp.d tptp.c) (* tptp.d (* (- 1) (- 3)))))) :rule la_mult_pos)
% 0.61/0.85  (step t1072 (cl (=> (and (> tptp.d 0) (>= tptp.c 3)) (>= (* tptp.d tptp.c) (* tptp.d (* (- 1) (- 3)))))) :rule resolution :premises (t1064 t1070 t1071))
% 0.61/0.85  (step t1073 (cl (=> (and (>= tptp.d 1) (>= tptp.c 3)) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)))) :rule resolution :premises (t1053 t1063 t1072))
% 0.61/0.85  (step t1074 (cl (not (and (>= tptp.d 1) (>= tptp.c 3))) (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1))) :rule implies :premises (t1073))
% 0.61/0.85  (step t1075 (cl (not (>= (+ (* 3 tptp.d) (* (- 1) (* tptp.d tptp.c))) 1)) (not (and (>= tptp.d 1) (>= tptp.c 3)))) :rule reordering :premises (t1074))
% 0.61/0.85  (step t1076 (cl (and (>= tptp.c 1) (>= tptp.d 7)) (not (>= tptp.c 1)) (not (>= tptp.d 7))) :rule and_neg)
% 0.61/0.85  (step t1077 (cl (not (>= tptp.c 1)) (not (>= tptp.d 7)) (and (>= tptp.c 1) (>= tptp.d 7))) :rule reordering :premises (t1076))
% 0.61/0.85  (step t1078 (cl (and (>= tptp.d 1) (>= tptp.c 3)) (not (>= tptp.d 1)) (not (>= tptp.c 3))) :rule and_neg)
% 0.61/0.85  (step t1079 (cl (not (>= tptp.d 1)) (not (>= tptp.c 3)) (and (>= tptp.d 1) (>= tptp.c 3))) :rule reordering :premises (t1078))
% 0.61/0.85  (step t1080 (cl (not (>= tptp.d 1)) (not (>= tptp.d 7)) (not (>= tptp.d 1)) (not (>= tptp.c 3))) :rule resolution :premises (t1024 t1052 t1075 t1077 t633 t1079))
% 0.61/0.85  (step t1081 (cl (not (>= tptp.d 1)) (not (>= tptp.d 7)) (not (>= tptp.c 3))) :rule contraction :premises (t1080))
% 0.61/0.85  (step t1082 (cl (not (>= tptp.d 5)) (>= tptp.d 1)) :rule or :premises (t288))
% 0.61/0.85  (step t1083 (cl (=> (>= tptp.d 6) (>= tptp.d 5)) (>= tptp.d 6)) :rule implies_neg1)
% 0.61/0.85  (anchor :step t1084)
% 0.61/0.85  (assume t1084.a0 (>= tptp.d 6))
% 0.61/0.85  (step t1084.t1 (cl (=> (>= tptp.d 6) (>= tptp.d 5)) (>= tptp.d 6)) :rule implies_neg1)
% 0.61/0.85  (anchor :step t1084.t2)
% 0.61/0.85  (assume t1084.t2.a0 (>= tptp.d 6))
% 0.61/0.85  (step t1084.t2.t1 (cl (not (= (not (< tptp.d 5)) (>= tptp.d 5))) (not (not (< tptp.d 5))) (>= tptp.d 5)) :rule equiv_pos2)
% 0.61/0.85  (step t1084.t2.t2 (cl (= (< tptp.d 5) (not (>= tptp.d 5)))) :rule all_simplify)
% 0.61/0.85  (step t1084.t2.t3 (cl (= (not (< tptp.d 5)) (not (not (>= tptp.d 5))))) :rule cong :premises (t1084.t2.t2))
% 0.61/0.85  (step t1084.t2.t4 (cl (= (not (< tptp.d 5)) (>= tptp.d 5))) :rule trans :premises (t1084.t2.t3 t301))
% 0.61/0.85  (step t1084.t2.t5 (cl (=> (< tptp.d 5) false) (< tptp.d 5)) :rule implies_neg1)
% 0.61/0.85  (anchor :step t1084.t2.t6)
% 0.61/0.85  (assume t1084.t2.t6.a0 (< tptp.d 5))
% 0.61/0.85  (step t1084.t2.t6.t1 (cl (not (= (< (+ (* 1.0 tptp.d) (* (- 1.0) tptp.d)) (+ (* 1.0 5) (* (- 1.0) 6))) false)) (not (< (+ (* 1.0 tptp.d) (* (- 1.0) tptp.d)) (+ (* 1.0 5) (* (- 1.0) 6)))) false) :rule equiv_pos2)
% 0.61/0.85  (step t1084.t2.t6.t2 (cl (= (< (+ (* 1.0 tptp.d) (* (- 1.0) tptp.d)) (+ (* 1.0 5) (* (- 1.0) 6))) (not (>= (+ (* 1.0 tptp.d) (* (- 1.0) tptp.d)) (+ (* 1.0 5) (* (- 1.0) 6)))))) :rule all_simplify)
% 0.61/0.85  (step t1084.t2.t6.t3 (cl (= (* 1.0 tptp.d) (to_real tptp.d))) :rule all_simplify)
% 0.61/0.85  (step t1084.t2.t6.t4 (cl (= (* (- 1.0) tptp.d) (to_real (* (- 1) tptp.d)))) :rule all_simplify)
% 0.61/0.85  (step t1084.t2.t6.t5 (cl (= (+ (* 1.0 tptp.d) (* (- 1.0) tptp.d)) (+ (to_real tptp.d) (to_real (* (- 1) tptp.d))))) :rule cong :premises (t1084.t2.t6.t3 t1084.t2.t6.t4))
% 0.61/0.85  (step t1084.t2.t6.t6 (cl (= (+ (to_real tptp.d) (to_real (* (- 1) tptp.d))) 0.0)) :rule all_simplify)
% 0.61/0.85  (step t1084.t2.t6.t7 (cl (= (+ (* 1.0 tptp.d) (* (- 1.0) tptp.d)) 0.0)) :rule trans :premises (t1084.t2.t6.t5 t1084.t2.t6.t6))
% 0.61/0.85  (step t1084.t2.t6.t8 (cl (= (* 1.0 5) 5.0)) :rule all_simplify)
% 0.61/0.85  (step t1084.t2.t6.t9 (cl (= (* (- 1.0) 6) (- 6.0))) :rule all_simplify)
% 0.61/0.85  (step t1084.t2.t6.t10 (cl (= (+ (* 1.0 5) (* (- 1.0) 6)) (+ 5.0 (- 6.0)))) :rule cong :premises (t1084.t2.t6.t8 t1084.t2.t6.t9))
% 0.61/0.85  (step t1084.t2.t6.t11 (cl (= (+ 5.0 (- 6.0)) (- 1.0))) :rule all_simplify)
% 0.61/0.85  (step t1084.t2.t6.t12 (cl (= (+ (* 1.0 5) (* (- 1.0) 6)) (- 1.0))) :rule trans :premises (t1084.t2.t6.t10 t1084.t2.t6.t11))
% 0.61/0.85  (step t1084.t2.t6.t13 (cl (= (>= (+ (* 1.0 tptp.d) (* (- 1.0) tptp.d)) (+ (* 1.0 5) (* (- 1.0) 6))) (>= 0.0 (- 1.0)))) :rule cong :premises (t1084.t2.t6.t7 t1084.t2.t6.t12))
% 0.61/0.85  (step t1084.t2.t6.t14 (cl (= (>= 0.0 (- 1.0)) true)) :rule all_simplify)
% 0.61/0.85  (step t1084.t2.t6.t15 (cl (= (>= (+ (* 1.0 tptp.d) (* (- 1.0) tptp.d)) (+ (* 1.0 5) (* (- 1.0) 6))) true)) :rule trans :premises (t1084.t2.t6.t13 t1084.t2.t6.t14))
% 0.61/0.85  (step t1084.t2.t6.t16 (cl (= (not (>= (+ (* 1.0 tptp.d) (* (- 1.0) tptp.d)) (+ (* 1.0 5) (* (- 1.0) 6)))) (not true))) :rule cong :premises (t1084.t2.t6.t15))
% 0.61/0.85  (step t1084.t2.t6.t17 (cl (= (not true) false)) :rule all_simplify)
% 0.61/0.85  (step t1084.t2.t6.t18 (cl (= (not (>= (+ (* 1.0 tptp.d) (* (- 1.0) tptp.d)) (+ (* 1.0 5) (* (- 1.0) 6)))) false)) :rule trans :premises (t1084.t2.t6.t16 t1084.t2.t6.t17))
% 0.61/0.85  (step t1084.t2.t6.t19 (cl (= (< (+ (* 1.0 tptp.d) (* (- 1.0) tptp.d)) (+ (* 1.0 5) (* (- 1.0) 6))) false)) :rule trans :premises (t1084.t2.t6.t2 t1084.t2.t6.t18))
% 0.61/0.85  (step t1084.t2.t6.t20 (cl (not (< (* 1.0 tptp.d) (* 1.0 5))) (not (<= (* (- 1.0) tptp.d) (* (- 1.0) 6))) (< (+ (* 1.0 tptp.d) (* (- 1.0) tptp.d)) (+ (* 1.0 5) (* (- 1.0) 6)))) :rule la_generic :args (1 1 1))
% 0.61/0.85  (step t1084.t2.t6.t21 (cl (=> (and (> 1.0 0) (< tptp.d 5)) (< (* 1.0 tptp.d) (* 1.0 5)))) :rule la_mult_pos)
% 0.61/0.85  (step t1084.t2.t6.t22 (cl (not (and (> 1.0 0) (< tptp.d 5))) (< (* 1.0 tptp.d) (* 1.0 5))) :rule implies :premises (t1084.t2.t6.t21))
% 0.61/0.85  (step t1084.t2.t6.t23 (cl (and (> 1.0 0) (< tptp.d 5)) (not (> 1.0 0)) (not (< tptp.d 5))) :rule and_neg)
% 0.61/0.85  (step t1084.t2.t6.t24 (cl (= (= (> 1.0 0) true) (> 1.0 0))) :rule equiv_simplify)
% 0.61/0.85  (step t1084.t2.t6.t25 (cl (not (= (> 1.0 0) true)) (> 1.0 0)) :rule equiv1 :premises (t1084.t2.t6.t24))
% 0.61/0.85  (step t1084.t2.t6.t26 (cl (= (> 1.0 0) true)) :rule hole :args ((> 1.0 0)))
% 0.61/0.85  (step t1084.t2.t6.t27 (cl (> 1.0 0)) :rule resolution :premises (t1084.t2.t6.t25 t1084.t2.t6.t26))
% 0.61/0.85  (step t1084.t2.t6.t28 (cl (and (> 1.0 0) (< tptp.d 5))) :rule resolution :premises (t1084.t2.t6.t23 t1084.t2.t6.t27 t1084.t2.t6.a0))
% 0.61/0.85  (step t1084.t2.t6.t29 (cl (< (* 1.0 tptp.d) (* 1.0 5))) :rule resolution :premises (t1084.t2.t6.t22 t1084.t2.t6.t28))
% 0.61/0.85  (step t1084.t2.t6.t30 (cl (=> (and (< (- 1.0) 0) (>= tptp.d 6)) (<= (* (- 1.0) tptp.d) (* (- 1.0) 6)))) :rule la_mult_neg)
% 0.61/0.85  (step t1084.t2.t6.t31 (cl (not (and (< (- 1.0) 0) (>= tptp.d 6))) (<= (* (- 1.0) tptp.d) (* (- 1.0) 6))) :rule implies :premises (t1084.t2.t6.t30))
% 0.61/0.85  (step t1084.t2.t6.t32 (cl (and (< (- 1.0) 0) (>= tptp.d 6)) (not (< (- 1.0) 0)) (not (>= tptp.d 6))) :rule and_neg)
% 0.61/0.85  (step t1084.t2.t6.t33 (cl (= (= (< (- 1.0) 0) true) (< (- 1.0) 0))) :rule equiv_simplify)
% 0.61/0.85  (step t1084.t2.t6.t34 (cl (not (= (< (- 1.0) 0) true)) (< (- 1.0) 0)) :rule equiv1 :premises (t1084.t2.t6.t33))
% 0.61/0.85  (step t1084.t2.t6.t35 (cl (= (< (- 1.0) 0) true)) :rule hole :args ((< (- 1.0) 0)))
% 0.61/0.85  (step t1084.t2.t6.t36 (cl (< (- 1.0) 0)) :rule resolution :premises (t1084.t2.t6.t34 t1084.t2.t6.t35))
% 0.61/0.85  (step t1084.t2.t6.t37 (cl (and (< (- 1.0) 0) (>= tptp.d 6))) :rule resolution :premises (t1084.t2.t6.t32 t1084.t2.t6.t36 t1084.t2.a0))
% 0.61/0.85  (step t1084.t2.t6.t38 (cl (<= (* (- 1.0) tptp.d) (* (- 1.0) 6))) :rule resolution :premises (t1084.t2.t6.t31 t1084.t2.t6.t37))
% 0.61/0.85  (step t1084.t2.t6.t39 (cl (< (+ (* 1.0 tptp.d) (* (- 1.0) tptp.d)) (+ (* 1.0 5) (* (- 1.0) 6)))) :rule resolution :premises (t1084.t2.t6.t20 t1084.t2.t6.t29 t1084.t2.t6.t38))
% 0.61/0.85  (step t1084.t2.t6.t40 (cl false) :rule resolution :premises (t1084.t2.t6.t1 t1084.t2.t6.t19 t1084.t2.t6.t39))
% 0.61/0.85  (step t1084.t2.t6 (cl (not (< tptp.d 5)) false) :rule subproof :discharge (t1084.t2.t6.a0))
% 0.61/0.85  (step t1084.t2.t7 (cl (=> (< tptp.d 5) false) false) :rule resolution :premises (t1084.t2.t5 t1084.t2.t6))
% 0.61/0.85  (step t1084.t2.t8 (cl (=> (< tptp.d 5) false) (not false)) :rule implies_neg2)
% 0.61/0.85  (step t1084.t2.t9 (cl (=> (< tptp.d 5) false) (=> (< tptp.d 5) false)) :rule resolution :premises (t1084.t2.t7 t1084.t2.t8))
% 0.61/0.85  (step t1084.t2.t10 (cl (=> (< tptp.d 5) false)) :rule contraction :premises (t1084.t2.t9))
% 0.61/0.85  (step t1084.t2.t11 (cl (= (=> (< tptp.d 5) false) (not (< tptp.d 5)))) :rule implies_simplify)
% 0.61/0.85  (step t1084.t2.t12 (cl (not (=> (< tptp.d 5) false)) (not (< tptp.d 5))) :rule equiv1 :premises (t1084.t2.t11))
% 0.61/0.85  (step t1084.t2.t13 (cl (not (< tptp.d 5))) :rule resolution :premises (t1084.t2.t10 t1084.t2.t12))
% 0.61/0.85  (step t1084.t2.t14 (cl (>= tptp.d 5)) :rule resolution :premises (t1084.t2.t1 t1084.t2.t4 t1084.t2.t13))
% 0.61/0.85  (step t1084.t2 (cl (not (>= tptp.d 6)) (>= tptp.d 5)) :rule subproof :discharge (t1084.t2.a0))
% 0.61/0.85  (step t1084.t3 (cl (=> (>= tptp.d 6) (>= tptp.d 5)) (>= tptp.d 5)) :rule resolution :premises (t1084.t1 t1084.t2))
% 0.61/0.85  (step t1084.t4 (cl (=> (>= tptp.d 6) (>= tptp.d 5)) (not (>= tptp.d 5))) :rule implies_neg2)
% 0.61/0.85  (step t1084.t5 (cl (=> (>= tptp.d 6) (>= tptp.d 5)) (=> (>= tptp.d 6) (>= tptp.d 5))) :rule resolution :premises (t1084.t3 t1084.t4))
% 0.61/0.85  (step t1084.t6 (cl (=> (>= tptp.d 6) (>= tptp.d 5))) :rule contraction :premises (t1084.t5))
% 0.61/0.85  (step t1084.t7 (cl (not (>= tptp.d 6)) (>= tptp.d 5)) :rule implies :premises (t1084.t6))
% 0.61/0.85  (step t1084.t8 (cl (>= tptp.d 5)) :rule resolution :premises (t1084.t7 t1084.a0))
% 0.61/0.85  (step t1084 (cl (not (>= tptp.d 6)) (>= tptp.d 5)) :rule subproof :discharge (t1084.a0))
% 0.61/0.85  (step t1085 (cl (=> (>= tptp.d 6) (>= tptp.d 5)) (>= tptp.d 5)) :rule resolution :premises (t1083 t1084))
% 0.61/0.85  (step t1086 (cl (=> (>= tptp.d 6) (>= tptp.d 5)) (not (>= tptp.d 5))) :rule implies_neg2)
% 0.61/0.85  (step t1087 (cl (=> (>= tptp.d 6) (>= tptp.d 5)) (=> (>= tptp.d 6) (>= tptp.d 5))) :rule resolution :premises (t1085 t1086))
% 0.61/0.85  (step t1088 (cl (=> (>= tptp.d 6) (>= tptp.d 5))) :rule contraction :premises (t1087))
% 0.61/0.85  (step t1089 (cl (not (>= tptp.d 6)) (>= tptp.d 5)) :rule implies :premises (t1088))
% 0.61/0.85  (step t1090 (cl (>= tptp.d 5) (not (>= tptp.d 6))) :rule reordering :premises (t1089))
% 0.61/0.85  (step t1091 (cl (not (= (or (= tptp.d 6) (or (not (>= tptp.d 6)) (>= tptp.d 7))) (or (= tptp.d 6) (not (>= tptp.d 6)) (>= tptp.d 7)))) (not (or (= tptp.d 6) (or (not (>= tptp.d 6)) (>= tptp.d 7)))) (or (= tptp.d 6) (not (>= tptp.d 6)) (>= tptp.d 7))) :rule equiv_pos2)
% 0.61/0.85  (step t1092 (cl (= (or (= tptp.d 6) (or (not (>= tptp.d 6)) (>= tptp.d 7))) (or (= tptp.d 6) (not (>= tptp.d 6)) (>= tptp.d 7)))) :rule all_simplify)
% 0.61/0.85  (step t1093 (cl (not (= (or (not (not (= tptp.d 6))) (not (not (< tptp.d 6))) (not (not (> tptp.d 6)))) (or (= tptp.d 6) (or (not (>= tptp.d 6)) (>= tptp.d 7))))) (not (or (not (not (= tptp.d 6))) (not (not (< tptp.d 6))) (not (not (> tptp.d 6))))) (or (= tptp.d 6) (or (not (>= tptp.d 6)) (>= tptp.d 7)))) :rule equiv_pos2)
% 0.61/0.85  (step t1094 (cl (= (not (not (= tptp.d 6))) (= tptp.d 6))) :rule all_simplify)
% 0.61/0.85  (step t1095 (cl (= (not (not (< tptp.d 6))) (< tptp.d 6))) :rule all_simplify)
% 0.61/0.85  (step t1096 (cl (= (< tptp.d 6) (not (>= tptp.d 6)))) :rule all_simplify)
% 0.61/0.85  (step t1097 (cl (= (not (not (< tptp.d 6))) (not (>= tptp.d 6)))) :rule trans :premises (t1095 t1096))
% 0.61/0.85  (step t1098 (cl (= (not (not (> tptp.d 6))) (> tptp.d 6))) :rule all_simplify)
% 0.61/0.85  (step t1099 (cl (= (> tptp.d 6) (not (<= tptp.d 6)))) :rule all_simplify)
% 0.61/0.85  (step t1100 (cl (= (<= tptp.d 6) (not (>= tptp.d 7)))) :rule all_simplify)
% 0.61/0.85  (step t1101 (cl (= (not (<= tptp.d 6)) (not (not (>= tptp.d 7))))) :rule cong :premises (t1100))
% 0.61/0.85  (step t1102 (cl (= (not (not (>= tptp.d 7))) (>= tptp.d 7))) :rule all_simplify)
% 0.61/0.85  (step t1103 (cl (= (not (<= tptp.d 6)) (>= tptp.d 7))) :rule trans :premises (t1101 t1102))
% 0.61/0.85  (step t1104 (cl (= (> tptp.d 6) (>= tptp.d 7))) :rule trans :premises (t1099 t1103))
% 0.61/0.85  (step t1105 (cl (= (not (not (> tptp.d 6))) (>= tptp.d 7))) :rule trans :premises (t1098 t1104))
% 0.61/0.85  (step t1106 (cl (= (or (not (not (= tptp.d 6))) (not (not (< tptp.d 6))) (not (not (> tptp.d 6)))) (or (= tptp.d 6) (not (>= tptp.d 6)) (>= tptp.d 7)))) :rule cong :premises (t1094 t1097 t1105))
% 0.61/0.85  (step t1107 (cl (= (or (= tptp.d 6) (or (not (>= tptp.d 6)) (>= tptp.d 7))) (or (= tptp.d 6) (not (>= tptp.d 6)) (>= tptp.d 7)))) :rule all_simplify)
% 0.61/0.85  (step t1108 (cl (= (or (= tptp.d 6) (not (>= tptp.d 6)) (>= tptp.d 7)) (or (= tptp.d 6) (or (not (>= tptp.d 6)) (>= tptp.d 7))))) :rule symm :premises (t1107))
% 0.61/0.85  (step t1109 (cl (= (or (not (not (= tptp.d 6))) (not (not (< tptp.d 6))) (not (not (> tptp.d 6)))) (or (= tptp.d 6) (or (not (>= tptp.d 6)) (>= tptp.d 7))))) :rule trans :premises (t1106 t1108))
% 0.61/0.85  (step t1110 (cl (=> (and (not (= tptp.d 6)) (not (< tptp.d 6)) (not (> tptp.d 6))) false) (and (not (= tptp.d 6)) (not (< tptp.d 6)) (not (> tptp.d 6)))) :rule implies_neg1)
% 0.61/0.85  (anchor :step t1111)
% 0.61/0.85  (assume t1111.a0 (not (= tptp.d 6)))
% 0.61/0.85  (assume t1111.a1 (not (< tptp.d 6)))
% 0.61/0.85  (assume t1111.a2 (not (> tptp.d 6)))
% 0.61/0.85  (step t1111.t1 (cl (or (= tptp.d 6) (not (<= tptp.d 6)) (not (<= 6 tptp.d)))) :rule la_disequality)
% 0.61/0.85  (step t1111.t2 (cl (= tptp.d 6) (not (<= tptp.d 6)) (not (<= 6 tptp.d))) :rule or :premises (t1111.t1))
% 0.61/0.85  (step t1111.t3 (cl (not (= (>= tptp.d 6) (<= 6 tptp.d))) (not (>= tptp.d 6)) (<= 6 tptp.d)) :rule equiv_pos2)
% 0.61/0.85  (step t1111.t4 (cl (= (>= tptp.d 6) (<= 6 tptp.d))) :rule comp_simplify)
% 0.61/0.85  (step t1111.t5 (cl (<= 6 tptp.d)) :rule resolution :premises (t1111.t3 t1111.t4 t1111.a0))
% 0.61/0.85  (step t1111.t6 (cl (not (<= tptp.d 6))) :rule resolution :premises (t1111.t2 t1111.t5 t1111.a1))
% 0.61/0.85  (step t1111.t7 (cl (not (= (> tptp.d 6) (not (<= tptp.d 6)))) (> tptp.d 6) (not (not (<= tptp.d 6)))) :rule equiv_pos1)
% 0.61/0.85  (step t1111.t8 (cl (= (> tptp.d 6) (not (<= tptp.d 6)))) :rule comp_simplify)
% 0.61/0.85  (step t1111.t9 (cl (> tptp.d 6)) :rule resolution :premises (t1111.t6 t1111.t7 t1111.t8))
% 0.61/0.85  (step t1111.t10 (cl) :rule resolution :premises (t1111.t9 t1111.a2))
% 0.61/0.85  (step t1111 (cl (not (not (= tptp.d 6))) (not (not (< tptp.d 6))) (not (not (> tptp.d 6))) false) :rule subproof :discharge (t1111.a0 t1111.a1 t1111.a2))
% 0.61/0.85  (step t1112 (cl (not (and (not (= tptp.d 6)) (not (< tptp.d 6)) (not (> tptp.d 6)))) (not (= tptp.d 6))) :rule and_pos)
% 0.61/0.85  (step t1113 (cl (not (and (not (= tptp.d 6)) (not (< tptp.d 6)) (not (> tptp.d 6)))) (not (< tptp.d 6))) :rule and_pos)
% 0.61/0.85  (step t1114 (cl (not (and (not (= tptp.d 6)) (not (< tptp.d 6)) (not (> tptp.d 6)))) (not (> tptp.d 6))) :rule and_pos)
% 0.61/0.85  (step t1115 (cl false (not (and (not (= tptp.d 6)) (not (< tptp.d 6)) (not (> tptp.d 6)))) (not (and (not (= tptp.d 6)) (not (< tptp.d 6)) (not (> tptp.d 6)))) (not (and (not (= tptp.d 6)) (not (< tptp.d 6)) (not (> tptp.d 6))))) :rule resolution :premises (t1111 t1112 t1113 t1114))
% 0.61/0.85  (step t1116 (cl (not (and (not (= tptp.d 6)) (not (< tptp.d 6)) (not (> tptp.d 6)))) (not (and (not (= tptp.d 6)) (not (< tptp.d 6)) (not (> tptp.d 6)))) (not (and (not (= tptp.d 6)) (not (< tptp.d 6)) (not (> tptp.d 6)))) false) :rule reordering :premises (t1115))
% 0.61/0.85  (step t1117 (cl (not (and (not (= tptp.d 6)) (not (< tptp.d 6)) (not (> tptp.d 6)))) false) :rule contraction :premises (t1116))
% 0.61/0.85  (step t1118 (cl (=> (and (not (= tptp.d 6)) (not (< tptp.d 6)) (not (> tptp.d 6))) false) false) :rule resolution :premises (t1110 t1117))
% 0.61/0.85  (step t1119 (cl (=> (and (not (= tptp.d 6)) (not (< tptp.d 6)) (not (> tptp.d 6))) false) (not false)) :rule implies_neg2)
% 0.61/0.85  (step t1120 (cl (=> (and (not (= tptp.d 6)) (not (< tptp.d 6)) (not (> tptp.d 6))) false) (=> (and (not (= tptp.d 6)) (not (< tptp.d 6)) (not (> tptp.d 6))) false)) :rule resolution :premises (t1118 t1119))
% 0.61/0.85  (step t1121 (cl (=> (and (not (= tptp.d 6)) (not (< tptp.d 6)) (not (> tptp.d 6))) false)) :rule contraction :premises (t1120))
% 0.61/0.85  (step t1122 (cl (= (=> (and (not (= tptp.d 6)) (not (< tptp.d 6)) (not (> tptp.d 6))) false) (not (and (not (= tptp.d 6)) (not (< tptp.d 6)) (not (> tptp.d 6)))))) :rule implies_simplify)
% 0.61/0.85  (step t1123 (cl (not (=> (and (not (= tptp.d 6)) (not (< tptp.d 6)) (not (> tptp.d 6))) false)) (not (and (not (= tptp.d 6)) (not (< tptp.d 6)) (not (> tptp.d 6))))) :rule equiv1 :premises (t1122))
% 0.61/0.85  (step t1124 (cl (not (and (not (= tptp.d 6)) (not (< tptp.d 6)) (not (> tptp.d 6))))) :rule resolution :premises (t1121 t1123))
% 0.61/0.85  (step t1125 (cl (not (not (= tptp.d 6))) (not (not (< tptp.d 6))) (not (not (> tptp.d 6)))) :rule not_and :premises (t1124))
% 0.61/0.85  (step t1126 (cl (or (not (not (= tptp.d 6))) (not (not (< tptp.d 6))) (not (not (> tptp.d 6)))) (not (not (not (= tptp.d 6))))) :rule or_neg)
% 0.61/0.85  (step t1127 (cl (or (not (not (= tptp.d 6))) (not (not (< tptp.d 6))) (not (not (> tptp.d 6)))) (not (not (not (< tptp.d 6))))) :rule or_neg)
% 0.61/0.85  (step t1128 (cl (or (not (not (= tptp.d 6))) (not (not (< tptp.d 6))) (not (not (> tptp.d 6)))) (not (not (not (> tptp.d 6))))) :rule or_neg)
% 0.61/0.85  (step t1129 (cl (or (not (not (= tptp.d 6))) (not (not (< tptp.d 6))) (not (not (> tptp.d 6)))) (or (not (not (= tptp.d 6))) (not (not (< tptp.d 6))) (not (not (> tptp.d 6)))) (or (not (not (= tptp.d 6))) (not (not (< tptp.d 6))) (not (not (> tptp.d 6))))) :rule resolution :premises (t1125 t1126 t1127 t1128))
% 0.61/0.85  (step t1130 (cl (or (not (not (= tptp.d 6))) (not (not (< tptp.d 6))) (not (not (> tptp.d 6))))) :rule contraction :premises (t1129))
% 0.61/0.85  (step t1131 (cl (or (= tptp.d 6) (or (not (>= tptp.d 6)) (>= tptp.d 7)))) :rule resolution :premises (t1093 t1109 t1130))
% 0.61/0.85  (step t1132 (cl (or (= tptp.d 6) (not (>= tptp.d 6)) (>= tptp.d 7))) :rule resolution :premises (t1091 t1092 t1131))
% 0.61/0.85  (step t1133 (cl (= tptp.d 6) (not (>= tptp.d 6)) (>= tptp.d 7)) :rule or :premises (t1132))
% 0.61/0.85  (step t1134 (cl (not (>= tptp.d 6)) (>= tptp.d 7) (= tptp.d 6)) :rule reordering :premises (t1133))
% 0.61/0.85  (step t1135 (cl (not (>= tptp.c 3)) (not (>= tptp.d 6)) (not (>= tptp.d 6)) (= tptp.d 6)) :rule resolution :premises (t1081 t1082 t1090 t1134))
% 0.61/0.85  (step t1136 (cl (not (>= tptp.c 3)) (not (>= tptp.d 6)) (= tptp.d 6)) :rule contraction :premises (t1135))
% 0.61/0.85  (step t1137 (cl (not (= (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (not (>= tptp.d 6))) (not (>= tptp.c 3))) (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1) (>= tptp.d 6) (not (>= tptp.c 3))))) (not (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (not (>= tptp.d 6))) (not (>= tptp.c 3)))) (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1) (>= tptp.d 6) (not (>= tptp.c 3)))) :rule equiv_pos2)
% 0.61/0.85  (step t1138 (cl (= (= (= (not (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) true) (= (not (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)))) :rule equiv_simplify)
% 0.61/0.85  (step t1139 (cl (not (= (= (not (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) true)) (= (not (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) :rule equiv1 :premises (t1138))
% 0.61/0.85  (step t1140 (cl (= (= (not (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (= (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1) (not (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)))))) :rule all_simplify)
% 0.61/0.85  (step t1141 (cl (= (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1) (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) :rule refl)
% 0.61/0.85  (step t1142 (cl (= (not (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) :rule all_simplify)
% 0.61/0.85  (step t1143 (cl (= (= (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1) (not (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)))) (= (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1) (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)))) :rule cong :premises (t1141 t1142))
% 0.61/0.85  (step t1144 (cl (= (= (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1) (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) true)) :rule all_simplify)
% 0.61/0.85  (step t1145 (cl (= (= (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1) (not (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)))) true)) :rule trans :premises (t1143 t1144))
% 0.61/0.85  (step t1146 (cl (= (= (not (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) true)) :rule trans :premises (t1140 t1145))
% 0.61/0.85  (step t1147 (cl (= (not (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) :rule resolution :premises (t1139 t1146))
% 0.61/0.85  (step t1148 (cl (= (= (= (not (not (>= tptp.d 6))) (>= tptp.d 6)) true) (= (not (not (>= tptp.d 6))) (>= tptp.d 6)))) :rule equiv_simplify)
% 0.61/0.85  (step t1149 (cl (not (= (= (not (not (>= tptp.d 6))) (>= tptp.d 6)) true)) (= (not (not (>= tptp.d 6))) (>= tptp.d 6))) :rule equiv1 :premises (t1148))
% 0.61/0.85  (step t1150 (cl (= (= (not (not (>= tptp.d 6))) (>= tptp.d 6)) (= (>= tptp.d 6) (not (not (>= tptp.d 6)))))) :rule all_simplify)
% 0.61/0.85  (step t1151 (cl (= (>= tptp.d 6) (>= tptp.d 6))) :rule refl)
% 0.61/0.85  (step t1152 (cl (= (not (not (>= tptp.d 6))) (>= tptp.d 6))) :rule all_simplify)
% 0.61/0.85  (step t1153 (cl (= (= (>= tptp.d 6) (not (not (>= tptp.d 6)))) (= (>= tptp.d 6) (>= tptp.d 6)))) :rule cong :premises (t1151 t1152))
% 0.61/0.85  (step t1154 (cl (= (= (>= tptp.d 6) (>= tptp.d 6)) true)) :rule all_simplify)
% 0.61/0.85  (step t1155 (cl (= (= (>= tptp.d 6) (not (not (>= tptp.d 6)))) true)) :rule trans :premises (t1153 t1154))
% 0.61/0.85  (step t1156 (cl (= (= (not (not (>= tptp.d 6))) (>= tptp.d 6)) true)) :rule trans :premises (t1150 t1155))
% 0.61/0.85  (step t1157 (cl (= (not (not (>= tptp.d 6))) (>= tptp.d 6))) :rule resolution :premises (t1149 t1156))
% 0.61/0.85  (step t1158 (cl (= (not (>= tptp.c 3)) (not (>= tptp.c 3)))) :rule refl)
% 0.61/0.85  (step t1159 (cl (= (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (not (>= tptp.d 6))) (not (>= tptp.c 3))) (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1) (>= tptp.d 6) (not (>= tptp.c 3))))) :rule cong :premises (t46 t1147 t1157 t1158))
% 0.61/0.85  (step t1160 (cl (not (= (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6)) (>= tptp.c 3)) (and (>= tptp.c 3) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6)))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6)) (>= tptp.c 3))))) (not (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6)) (>= tptp.c 3)) (and (>= tptp.c 3) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6))))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6)) (>= tptp.c 3)))) :rule equiv_pos2)
% 0.61/0.85  (step t1161 (cl (= (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6)) (>= tptp.c 3)) (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6)) (>= tptp.c 3)))) :rule refl)
% 0.61/0.85  (step t1162 (cl (= (= (and (>= tptp.c 3) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6))) false) (not (and (>= tptp.c 3) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6)))))) :rule equiv_simplify)
% 0.61/0.85  (step t1163 (cl (= (and (>= tptp.c 3) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6))) false) (not (not (and (>= tptp.c 3) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6)))))) :rule equiv2 :premises (t1162))
% 0.61/0.85  (step t1164 (cl (not (not (not (and (>= tptp.c 3) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6)))))) (and (>= tptp.c 3) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6)))) :rule not_not)
% 0.61/0.85  (step t1165 (cl (= (and (>= tptp.c 3) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6))) false) (and (>= tptp.c 3) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6)))) :rule resolution :premises (t1163 t1164))
% 0.61/0.85  (step t1166 (cl (=> (and (>= tptp.c 3) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6))) false) (and (>= tptp.c 3) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6)))) :rule implies_neg1)
% 0.61/0.85  (anchor :step t1167)
% 0.61/0.85  (assume t1167.a0 (>= tptp.c 3))
% 0.61/0.85  (assume t1167.a1 (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))
% 0.61/0.85  (assume t1167.a2 (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)))
% 0.61/0.85  (assume t1167.a3 (not (>= tptp.d 6)))
% 0.61/0.85  (step t1167.t1 (cl (not (= (not (>= tptp.d 6)) (< tptp.d 6))) (not (not (>= tptp.d 6))) (< tptp.d 6)) :rule equiv_pos2)
% 0.61/0.85  (step t1167.t2 (cl (= (not (>= tptp.d 6)) (< tptp.d 6))) :rule symm :premises (t1096))
% 0.61/0.85  (step t1167.t3 (cl (< tptp.d 6)) :rule resolution :premises (t1167.t1 t1167.t2 t1167.a3))
% 0.61/0.85  (step t1167.t4 (cl (not (= (>= tptp.d 6) (not (< tptp.d 6)))) (not (>= tptp.d 6)) (not (< tptp.d 6))) :rule equiv_pos2)
% 0.61/0.85  (step t1167.t5 (cl (= (not (< tptp.d 6)) (not (not (>= tptp.d 6))))) :rule cong :premises (t1096))
% 0.61/0.85  (step t1167.t6 (cl (= (not (< tptp.d 6)) (>= tptp.d 6))) :rule trans :premises (t1167.t5 t1152))
% 0.61/0.85  (step t1167.t7 (cl (= (>= tptp.d 6) (not (< tptp.d 6)))) :rule symm :premises (t1167.t6))
% 0.61/0.85  (step t1167.t8 (cl (not (= (not (< tptp.d 6)) (>= tptp.d 6))) (not (not (< tptp.d 6))) (>= tptp.d 6)) :rule equiv_pos2)
% 0.61/0.85  (step t1167.t9 (cl (=> (< tptp.d 6) false) (< tptp.d 6)) :rule implies_neg1)
% 0.61/0.85  (anchor :step t1167.t10)
% 0.61/0.85  (assume t1167.t10.a0 (< tptp.d 6))
% 0.61/0.85  (step t1167.t10.t1 (cl (not (= (< (+ (* 1.0 tptp.d) (* (/ 1 2) (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ (- 1) 2) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) tptp.c)) (+ (* 1.0 6) (* (/ 1 2) 1) (* (/ (- 1) 2) 7) (* (- 1.0) 3))) false)) (not (< (+ (* 1.0 tptp.d) (* (/ 1 2) (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ (- 1) 2) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) tptp.c)) (+ (* 1.0 6) (* (/ 1 2) 1) (* (/ (- 1) 2) 7) (* (- 1.0) 3)))) false) :rule equiv_pos2)
% 0.61/0.85  (step t1167.t10.t2 (cl (= (< (+ (* 1.0 tptp.d) (* (/ 1 2) (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ (- 1) 2) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) tptp.c)) (+ (* 1.0 6) (* (/ 1 2) 1) (* (/ (- 1) 2) 7) (* (- 1.0) 3))) (not (>= (+ (* 1.0 tptp.d) (* (/ 1 2) (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ (- 1) 2) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) tptp.c)) (+ (* 1.0 6) (* (/ 1 2) 1) (* (/ (- 1) 2) 7) (* (- 1.0) 3)))))) :rule all_simplify)
% 0.61/0.85  (step t1167.t10.t3 (cl (= (* 1.0 tptp.d) (to_real tptp.d))) :rule all_simplify)
% 0.61/0.85  (step t1167.t10.t4 (cl (= (* (/ 1 2) (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (+ (* (/ 5 2) tptp.c) (* (/ (- 1) 2) (* tptp.d tptp.c))))) :rule all_simplify)
% 0.61/0.85  (step t1167.t10.t5 (cl (= (* (/ (- 1) 2) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (+ (* (- 1) tptp.d) (* (/ (- 3) 2) tptp.c) (* (/ 1 2) (* tptp.d tptp.c))))) :rule all_simplify)
% 0.61/0.85  (step t1167.t10.t6 (cl (= (* (- 1.0) tptp.c) (to_real (* (- 1) tptp.c)))) :rule all_simplify)
% 0.61/0.85  (step t1167.t10.t7 (cl (= (+ (* 1.0 tptp.d) (* (/ 1 2) (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ (- 1) 2) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) tptp.c)) (+ (to_real tptp.d) (+ (* (/ 5 2) tptp.c) (* (/ (- 1) 2) (* tptp.d tptp.c))) (+ (* (- 1) tptp.d) (* (/ (- 3) 2) tptp.c) (* (/ 1 2) (* tptp.d tptp.c))) (to_real (* (- 1) tptp.c))))) :rule cong :premises (t1167.t10.t3 t1167.t10.t4 t1167.t10.t5 t1167.t10.t6))
% 0.61/0.85  (step t1167.t10.t8 (cl (= (+ (to_real tptp.d) (+ (* (/ 5 2) tptp.c) (* (/ (- 1) 2) (* tptp.d tptp.c))) (+ (* (- 1) tptp.d) (* (/ (- 3) 2) tptp.c) (* (/ 1 2) (* tptp.d tptp.c))) (to_real (* (- 1) tptp.c))) 0.0)) :rule all_simplify)
% 0.61/0.85  (step t1167.t10.t9 (cl (= (+ (* 1.0 tptp.d) (* (/ 1 2) (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ (- 1) 2) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) tptp.c)) 0.0)) :rule trans :premises (t1167.t10.t7 t1167.t10.t8))
% 0.61/0.85  (step t1167.t10.t10 (cl (= (* 1.0 6) 6.0)) :rule all_simplify)
% 0.61/0.85  (step t1167.t10.t11 (cl (= (* (/ 1 2) 1) (/ 1 2))) :rule all_simplify)
% 0.61/0.85  (step t1167.t10.t12 (cl (= (* (/ (- 1) 2) 7) (/ (- 7) 2))) :rule all_simplify)
% 0.61/0.85  (step t1167.t10.t13 (cl (= (* (- 1.0) 3) (- 3.0))) :rule all_simplify)
% 0.61/0.85  (step t1167.t10.t14 (cl (= (+ (* 1.0 6) (* (/ 1 2) 1) (* (/ (- 1) 2) 7) (* (- 1.0) 3)) (+ 6.0 (/ 1 2) (/ (- 7) 2) (- 3.0)))) :rule cong :premises (t1167.t10.t10 t1167.t10.t11 t1167.t10.t12 t1167.t10.t13))
% 0.61/0.85  (step t1167.t10.t15 (cl (= (+ 6.0 (/ 1 2) (/ (- 7) 2) (- 3.0)) 0.0)) :rule all_simplify)
% 0.61/0.85  (step t1167.t10.t16 (cl (= (+ (* 1.0 6) (* (/ 1 2) 1) (* (/ (- 1) 2) 7) (* (- 1.0) 3)) 0.0)) :rule trans :premises (t1167.t10.t14 t1167.t10.t15))
% 0.61/0.85  (step t1167.t10.t17 (cl (= (>= (+ (* 1.0 tptp.d) (* (/ 1 2) (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ (- 1) 2) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) tptp.c)) (+ (* 1.0 6) (* (/ 1 2) 1) (* (/ (- 1) 2) 7) (* (- 1.0) 3))) (>= 0.0 0.0))) :rule cong :premises (t1167.t10.t9 t1167.t10.t16))
% 0.61/0.85  (step t1167.t10.t18 (cl (= (>= 0.0 0.0) true)) :rule all_simplify)
% 0.61/0.85  (step t1167.t10.t19 (cl (= (>= (+ (* 1.0 tptp.d) (* (/ 1 2) (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ (- 1) 2) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) tptp.c)) (+ (* 1.0 6) (* (/ 1 2) 1) (* (/ (- 1) 2) 7) (* (- 1.0) 3))) true)) :rule trans :premises (t1167.t10.t17 t1167.t10.t18))
% 0.61/0.85  (step t1167.t10.t20 (cl (= (not (>= (+ (* 1.0 tptp.d) (* (/ 1 2) (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ (- 1) 2) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) tptp.c)) (+ (* 1.0 6) (* (/ 1 2) 1) (* (/ (- 1) 2) 7) (* (- 1.0) 3)))) (not true))) :rule cong :premises (t1167.t10.t19))
% 0.61/0.85  (step t1167.t10.t21 (cl (= (not true) false)) :rule all_simplify)
% 0.61/0.85  (step t1167.t10.t22 (cl (= (not (>= (+ (* 1.0 tptp.d) (* (/ 1 2) (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ (- 1) 2) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) tptp.c)) (+ (* 1.0 6) (* (/ 1 2) 1) (* (/ (- 1) 2) 7) (* (- 1.0) 3)))) false)) :rule trans :premises (t1167.t10.t20 t1167.t10.t21))
% 0.61/0.85  (step t1167.t10.t23 (cl (= (< (+ (* 1.0 tptp.d) (* (/ 1 2) (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ (- 1) 2) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) tptp.c)) (+ (* 1.0 6) (* (/ 1 2) 1) (* (/ (- 1) 2) 7) (* (- 1.0) 3))) false)) :rule trans :premises (t1167.t10.t2 t1167.t10.t22))
% 0.61/0.85  (step t1167.t10.t24 (cl (not (< (* 1.0 tptp.d) (* 1.0 6))) (not (< (* (/ 1 2) (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ 1 2) 1))) (not (<= (* (/ (- 1) 2) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ (- 1) 2) 7))) (not (<= (* (- 1.0) tptp.c) (* (- 1.0) 3))) (< (+ (* 1.0 tptp.d) (* (/ 1 2) (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ (- 1) 2) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) tptp.c)) (+ (* 1.0 6) (* (/ 1 2) 1) (* (/ (- 1) 2) 7) (* (- 1.0) 3)))) :rule la_generic :args (1 1 1 1 1))
% 0.61/0.85  (step t1167.t10.t25 (cl (=> (and (> 1.0 0) (< tptp.d 6)) (< (* 1.0 tptp.d) (* 1.0 6)))) :rule la_mult_pos)
% 0.61/0.85  (step t1167.t10.t26 (cl (not (and (> 1.0 0) (< tptp.d 6))) (< (* 1.0 tptp.d) (* 1.0 6))) :rule implies :premises (t1167.t10.t25))
% 0.61/0.85  (step t1167.t10.t27 (cl (and (> 1.0 0) (< tptp.d 6)) (not (> 1.0 0)) (not (< tptp.d 6))) :rule and_neg)
% 0.61/0.85  (step t1167.t10.t28 (cl (= (= (> 1.0 0) true) (> 1.0 0))) :rule equiv_simplify)
% 0.61/0.85  (step t1167.t10.t29 (cl (not (= (> 1.0 0) true)) (> 1.0 0)) :rule equiv1 :premises (t1167.t10.t28))
% 0.61/0.85  (step t1167.t10.t30 (cl (= (> 1.0 0) true)) :rule hole :args ((> 1.0 0)))
% 0.61/0.85  (step t1167.t10.t31 (cl (> 1.0 0)) :rule resolution :premises (t1167.t10.t29 t1167.t10.t30))
% 0.61/0.85  (step t1167.t10.t32 (cl (and (> 1.0 0) (< tptp.d 6))) :rule resolution :premises (t1167.t10.t27 t1167.t10.t31 t1167.t10.a0))
% 0.61/0.85  (step t1167.t10.t33 (cl (< (* 1.0 tptp.d) (* 1.0 6))) :rule resolution :premises (t1167.t10.t26 t1167.t10.t32))
% 0.61/0.85  (step t1167.t10.t34 (cl (=> (and (> (/ 1 2) 0) (< (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (< (* (/ 1 2) (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ 1 2) 1)))) :rule la_mult_pos)
% 0.61/0.85  (step t1167.t10.t35 (cl (not (and (> (/ 1 2) 0) (< (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (< (* (/ 1 2) (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ 1 2) 1))) :rule implies :premises (t1167.t10.t34))
% 0.61/0.85  (step t1167.t10.t36 (cl (and (> (/ 1 2) 0) (< (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (> (/ 1 2) 0)) (not (< (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) :rule and_neg)
% 0.61/0.85  (step t1167.t10.t37 (cl (= (= (> (/ 1 2) 0) true) (> (/ 1 2) 0))) :rule equiv_simplify)
% 0.61/0.85  (step t1167.t10.t38 (cl (not (= (> (/ 1 2) 0) true)) (> (/ 1 2) 0)) :rule equiv1 :premises (t1167.t10.t37))
% 0.61/0.85  (step t1167.t10.t39 (cl (= (> (/ 1 2) 0) true)) :rule hole :args ((> (/ 1 2) 0)))
% 0.61/0.85  (step t1167.t10.t40 (cl (> (/ 1 2) 0)) :rule resolution :premises (t1167.t10.t38 t1167.t10.t39))
% 0.61/0.85  (step t1167.t10.t41 (cl (not (= (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (< (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (< (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) :rule equiv_pos2)
% 0.61/0.85  (step t1167.t10.t42 (cl (= (< (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)))) :rule all_simplify)
% 0.61/0.85  (step t1167.t10.t43 (cl (= (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (< (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) :rule symm :premises (t1167.t10.t42))
% 0.61/0.85  (step t1167.t10.t44 (cl (< (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) :rule resolution :premises (t1167.t10.t41 t1167.t10.t43 t1167.a2))
% 0.61/0.85  (step t1167.t10.t45 (cl (and (> (/ 1 2) 0) (< (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) :rule resolution :premises (t1167.t10.t36 t1167.t10.t40 t1167.t10.t44))
% 0.61/0.85  (step t1167.t10.t46 (cl (< (* (/ 1 2) (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ 1 2) 1))) :rule resolution :premises (t1167.t10.t35 t1167.t10.t45))
% 0.61/0.85  (step t1167.t10.t47 (cl (=> (and (< (/ (- 1) 2) 0) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (<= (* (/ (- 1) 2) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ (- 1) 2) 7)))) :rule la_mult_neg)
% 0.61/0.85  (step t1167.t10.t48 (cl (not (and (< (/ (- 1) 2) 0) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (<= (* (/ (- 1) 2) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ (- 1) 2) 7))) :rule implies :premises (t1167.t10.t47))
% 0.61/0.85  (step t1167.t10.t49 (cl (and (< (/ (- 1) 2) 0) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (< (/ (- 1) 2) 0)) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule and_neg)
% 0.61/0.85  (step t1167.t10.t50 (cl (= (= (< (/ (- 1) 2) 0) true) (< (/ (- 1) 2) 0))) :rule equiv_simplify)
% 0.61/0.85  (step t1167.t10.t51 (cl (not (= (< (/ (- 1) 2) 0) true)) (< (/ (- 1) 2) 0)) :rule equiv1 :premises (t1167.t10.t50))
% 0.61/0.85  (step t1167.t10.t52 (cl (= (< (/ (- 1) 2) 0) true)) :rule hole :args ((< (/ (- 1) 2) 0)))
% 0.61/0.85  (step t1167.t10.t53 (cl (< (/ (- 1) 2) 0)) :rule resolution :premises (t1167.t10.t51 t1167.t10.t52))
% 0.61/0.85  (step t1167.t10.t54 (cl (and (< (/ (- 1) 2) 0) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule resolution :premises (t1167.t10.t49 t1167.t10.t53 t1167.a1))
% 0.61/0.85  (step t1167.t10.t55 (cl (<= (* (/ (- 1) 2) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ (- 1) 2) 7))) :rule resolution :premises (t1167.t10.t48 t1167.t10.t54))
% 0.61/0.85  (step t1167.t10.t56 (cl (=> (and (< (- 1.0) 0) (>= tptp.c 3)) (<= (* (- 1.0) tptp.c) (* (- 1.0) 3)))) :rule la_mult_neg)
% 0.61/0.85  (step t1167.t10.t57 (cl (not (and (< (- 1.0) 0) (>= tptp.c 3))) (<= (* (- 1.0) tptp.c) (* (- 1.0) 3))) :rule implies :premises (t1167.t10.t56))
% 0.61/0.85  (step t1167.t10.t58 (cl (and (< (- 1.0) 0) (>= tptp.c 3)) (not (< (- 1.0) 0)) (not (>= tptp.c 3))) :rule and_neg)
% 0.61/0.85  (step t1167.t10.t59 (cl (= (= (< (- 1.0) 0) true) (< (- 1.0) 0))) :rule equiv_simplify)
% 0.61/0.85  (step t1167.t10.t60 (cl (not (= (< (- 1.0) 0) true)) (< (- 1.0) 0)) :rule equiv1 :premises (t1167.t10.t59))
% 0.61/0.85  (step t1167.t10.t61 (cl (= (< (- 1.0) 0) true)) :rule hole :args ((< (- 1.0) 0)))
% 0.61/0.85  (step t1167.t10.t62 (cl (< (- 1.0) 0)) :rule resolution :premises (t1167.t10.t60 t1167.t10.t61))
% 0.61/0.85  (step t1167.t10.t63 (cl (and (< (- 1.0) 0) (>= tptp.c 3))) :rule resolution :premises (t1167.t10.t58 t1167.t10.t62 t1167.a0))
% 0.61/0.85  (step t1167.t10.t64 (cl (<= (* (- 1.0) tptp.c) (* (- 1.0) 3))) :rule resolution :premises (t1167.t10.t57 t1167.t10.t63))
% 0.61/0.85  (step t1167.t10.t65 (cl (< (+ (* 1.0 tptp.d) (* (/ 1 2) (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (/ (- 1) 2) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) tptp.c)) (+ (* 1.0 6) (* (/ 1 2) 1) (* (/ (- 1) 2) 7) (* (- 1.0) 3)))) :rule resolution :premises (t1167.t10.t24 t1167.t10.t33 t1167.t10.t46 t1167.t10.t55 t1167.t10.t64))
% 0.61/0.85  (step t1167.t10.t66 (cl false) :rule resolution :premises (t1167.t10.t1 t1167.t10.t23 t1167.t10.t65))
% 0.61/0.85  (step t1167.t10 (cl (not (< tptp.d 6)) false) :rule subproof :discharge (t1167.t10.a0))
% 0.61/0.85  (step t1167.t11 (cl (=> (< tptp.d 6) false) false) :rule resolution :premises (t1167.t9 t1167.t10))
% 0.61/0.85  (step t1167.t12 (cl (=> (< tptp.d 6) false) (not false)) :rule implies_neg2)
% 0.61/0.85  (step t1167.t13 (cl (=> (< tptp.d 6) false) (=> (< tptp.d 6) false)) :rule resolution :premises (t1167.t11 t1167.t12))
% 0.61/0.85  (step t1167.t14 (cl (=> (< tptp.d 6) false)) :rule contraction :premises (t1167.t13))
% 0.61/0.85  (step t1167.t15 (cl (= (=> (< tptp.d 6) false) (not (< tptp.d 6)))) :rule implies_simplify)
% 0.61/0.85  (step t1167.t16 (cl (not (=> (< tptp.d 6) false)) (not (< tptp.d 6))) :rule equiv1 :premises (t1167.t15))
% 0.61/0.85  (step t1167.t17 (cl (not (< tptp.d 6))) :rule resolution :premises (t1167.t14 t1167.t16))
% 0.61/0.85  (step t1167.t18 (cl (>= tptp.d 6)) :rule resolution :premises (t1167.t8 t1167.t6 t1167.t17))
% 0.61/0.85  (step t1167.t19 (cl (not (< tptp.d 6))) :rule resolution :premises (t1167.t4 t1167.t7 t1167.t18))
% 0.61/0.85  (step t1167.t20 (cl) :rule resolution :premises (t1167.t3 t1167.t19))
% 0.61/0.85  (step t1167 (cl (not (>= tptp.c 3)) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (not (>= tptp.d 6))) false) :rule subproof :discharge (t1167.a0 t1167.a1 t1167.a2 t1167.a3))
% 0.61/0.85  (step t1168 (cl (not (and (>= tptp.c 3) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6)))) (>= tptp.c 3)) :rule and_pos)
% 0.61/0.85  (step t1169 (cl (not (and (>= tptp.c 3) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6)))) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) :rule and_pos)
% 0.61/0.85  (step t1170 (cl (not (and (>= tptp.c 3) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6)))) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) :rule and_pos)
% 0.61/0.85  (step t1171 (cl (not (and (>= tptp.c 3) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6)))) (not (>= tptp.d 6))) :rule and_pos)
% 0.61/0.85  (step t1172 (cl false (not (and (>= tptp.c 3) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6)))) (not (and (>= tptp.c 3) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6)))) (not (and (>= tptp.c 3) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6)))) (not (and (>= tptp.c 3) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6))))) :rule resolution :premises (t1167 t1168 t1169 t1170 t1171))
% 0.61/0.85  (step t1173 (cl (not (and (>= tptp.c 3) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6)))) (not (and (>= tptp.c 3) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6)))) (not (and (>= tptp.c 3) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6)))) (not (and (>= tptp.c 3) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6)))) false) :rule reordering :premises (t1172))
% 0.61/0.85  (step t1174 (cl (not (and (>= tptp.c 3) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6)))) false) :rule contraction :premises (t1173))
% 0.61/0.85  (step t1175 (cl (=> (and (>= tptp.c 3) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6))) false) false) :rule resolution :premises (t1166 t1174))
% 0.61/0.85  (step t1176 (cl (=> (and (>= tptp.c 3) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6))) false) (not false)) :rule implies_neg2)
% 0.61/0.85  (step t1177 (cl (=> (and (>= tptp.c 3) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6))) false) (=> (and (>= tptp.c 3) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6))) false)) :rule resolution :premises (t1175 t1176))
% 0.61/0.85  (step t1178 (cl (=> (and (>= tptp.c 3) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6))) false)) :rule contraction :premises (t1177))
% 0.61/0.85  (step t1179 (cl (= (=> (and (>= tptp.c 3) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6))) false) (not (and (>= tptp.c 3) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6)))))) :rule implies_simplify)
% 0.61/0.85  (step t1180 (cl (not (=> (and (>= tptp.c 3) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6))) false)) (not (and (>= tptp.c 3) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6))))) :rule equiv1 :premises (t1179))
% 0.61/0.85  (step t1181 (cl (not (and (>= tptp.c 3) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6))))) :rule resolution :premises (t1178 t1180))
% 0.61/0.85  (step t1182 (cl (= (and (>= tptp.c 3) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6))) false)) :rule resolution :premises (t1165 t1181))
% 0.61/0.85  (step t1183 (cl (= (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6)) (>= tptp.c 3)) (and (>= tptp.c 3) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6)))) (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6)) (>= tptp.c 3)) false))) :rule cong :premises (t1161 t1182))
% 0.61/0.85  (step t1184 (cl (= (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6)) (>= tptp.c 3)) false) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6)) (>= tptp.c 3))))) :rule all_simplify)
% 0.61/0.85  (step t1185 (cl (= (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6)) (>= tptp.c 3)) (and (>= tptp.c 3) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6)))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6)) (>= tptp.c 3))))) :rule trans :premises (t1183 t1184))
% 0.61/0.85  (step t1186 (cl (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6)) (>= tptp.c 3)) (and (>= tptp.c 3) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6)))) (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6)) (>= tptp.c 3))) :rule implies_neg1)
% 0.61/0.85  (anchor :step t1187)
% 0.61/0.85  (assume t1187.a0 (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))
% 0.61/0.85  (assume t1187.a1 (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)))
% 0.61/0.85  (assume t1187.a2 (not (>= tptp.d 6)))
% 0.61/0.85  (assume t1187.a3 (>= tptp.c 3))
% 0.61/0.85  (step t1187.t1 (cl (and (>= tptp.c 3) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6))) (not (>= tptp.c 3)) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (not (>= tptp.d 6)))) :rule and_neg)
% 0.61/0.85  (step t1187.t2 (cl (and (>= tptp.c 3) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6)))) :rule resolution :premises (t1187.t1 t1187.a3 t1187.a0 t1187.a1 t1187.a2))
% 0.61/0.85  (step t1187 (cl (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (not (>= tptp.d 6))) (not (>= tptp.c 3)) (and (>= tptp.c 3) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6)))) :rule subproof :discharge (t1187.a0 t1187.a1 t1187.a2 t1187.a3))
% 0.61/0.85  (step t1188 (cl (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6)) (>= tptp.c 3))) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) :rule and_pos)
% 0.61/0.85  (step t1189 (cl (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6)) (>= tptp.c 3))) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) :rule and_pos)
% 0.61/0.85  (step t1190 (cl (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6)) (>= tptp.c 3))) (not (>= tptp.d 6))) :rule and_pos)
% 0.61/0.85  (step t1191 (cl (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6)) (>= tptp.c 3))) (>= tptp.c 3)) :rule and_pos)
% 0.61/0.85  (step t1192 (cl (and (>= tptp.c 3) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6)) (>= tptp.c 3))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6)) (>= tptp.c 3))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6)) (>= tptp.c 3))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6)) (>= tptp.c 3)))) :rule resolution :premises (t1187 t1188 t1189 t1190 t1191))
% 0.61/0.85  (step t1193 (cl (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6)) (>= tptp.c 3))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6)) (>= tptp.c 3))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6)) (>= tptp.c 3))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6)) (>= tptp.c 3))) (and (>= tptp.c 3) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6)))) :rule reordering :premises (t1192))
% 0.61/0.85  (step t1194 (cl (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6)) (>= tptp.c 3))) (and (>= tptp.c 3) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6)))) :rule contraction :premises (t1193))
% 0.61/0.85  (step t1195 (cl (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6)) (>= tptp.c 3)) (and (>= tptp.c 3) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6)))) (and (>= tptp.c 3) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6)))) :rule resolution :premises (t1186 t1194))
% 0.61/0.85  (step t1196 (cl (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6)) (>= tptp.c 3)) (and (>= tptp.c 3) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6)))) (not (and (>= tptp.c 3) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6))))) :rule implies_neg2)
% 0.61/0.85  (step t1197 (cl (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6)) (>= tptp.c 3)) (and (>= tptp.c 3) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6)))) (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6)) (>= tptp.c 3)) (and (>= tptp.c 3) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6))))) :rule resolution :premises (t1195 t1196))
% 0.61/0.85  (step t1198 (cl (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6)) (>= tptp.c 3)) (and (>= tptp.c 3) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6))))) :rule contraction :premises (t1197))
% 0.61/0.85  (step t1199 (cl (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (>= tptp.d 6)) (>= tptp.c 3)))) :rule resolution :premises (t1160 t1185 t1198))
% 0.61/0.85  (step t1200 (cl (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (not (>= tptp.d 6))) (not (>= tptp.c 3))) :rule not_and :premises (t1199))
% 0.61/0.85  (step t1201 (cl (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (not (>= tptp.d 6))) (not (>= tptp.c 3))) (not (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)))) :rule or_neg)
% 0.61/0.85  (step t1202 (cl (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (not (>= tptp.d 6))) (not (>= tptp.c 3))) (not (not (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))))) :rule or_neg)
% 0.61/0.85  (step t1203 (cl (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (not (>= tptp.d 6))) (not (>= tptp.c 3))) (not (not (not (>= tptp.d 6))))) :rule or_neg)
% 0.61/0.85  (step t1204 (cl (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (not (>= tptp.d 6))) (not (>= tptp.c 3))) (not (not (>= tptp.c 3)))) :rule or_neg)
% 0.61/0.85  (step t1205 (cl (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (not (>= tptp.d 6))) (not (>= tptp.c 3))) (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (not (>= tptp.d 6))) (not (>= tptp.c 3))) (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (not (>= tptp.d 6))) (not (>= tptp.c 3))) (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (not (>= tptp.d 6))) (not (>= tptp.c 3)))) :rule resolution :premises (t1200 t1201 t1202 t1203 t1204))
% 0.61/0.85  (step t1206 (cl (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (not (>= tptp.d 6))) (not (>= tptp.c 3)))) :rule contraction :premises (t1205))
% 0.61/0.85  (step t1207 (cl (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1) (>= tptp.d 6) (not (>= tptp.c 3)))) :rule resolution :premises (t1137 t1159 t1206))
% 0.61/0.85  (step t1208 (cl (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1) (>= tptp.d 6) (not (>= tptp.c 3))) :rule or :premises (t1207))
% 0.61/0.85  (step t1209 (cl (not (= (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (= tptp.d 6)) (not (>= tptp.c 3))) (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1) (not (= tptp.d 6)) (not (>= tptp.c 3))))) (not (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (= tptp.d 6)) (not (>= tptp.c 3)))) (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1) (not (= tptp.d 6)) (not (>= tptp.c 3)))) :rule equiv_pos2)
% 0.61/0.85  (step t1210 (cl (= (not (= tptp.d 6)) (not (= tptp.d 6)))) :rule refl)
% 0.61/0.85  (step t1211 (cl (= (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (= tptp.d 6)) (not (>= tptp.c 3))) (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1) (not (= tptp.d 6)) (not (>= tptp.c 3))))) :rule cong :premises (t46 t1147 t1210 t1158))
% 0.61/0.85  (step t1212 (cl (not (= (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.d 6) (>= tptp.c 3)) (and (>= tptp.c 3) (= tptp.d 6) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.d 6) (>= tptp.c 3))))) (not (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.d 6) (>= tptp.c 3)) (and (>= tptp.c 3) (= tptp.d 6) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.d 6) (>= tptp.c 3)))) :rule equiv_pos2)
% 0.61/0.85  (step t1213 (cl (= (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.d 6) (>= tptp.c 3)) (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.d 6) (>= tptp.c 3)))) :rule refl)
% 0.61/0.85  (step t1214 (cl (= (= (and (>= tptp.c 3) (= tptp.d 6) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) false) (not (and (>= tptp.c 3) (= tptp.d 6) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))))) :rule equiv_simplify)
% 0.61/0.85  (step t1215 (cl (= (and (>= tptp.c 3) (= tptp.d 6) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) false) (not (not (and (>= tptp.c 3) (= tptp.d 6) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))))) :rule equiv2 :premises (t1214))
% 0.61/0.85  (step t1216 (cl (not (not (not (and (>= tptp.c 3) (= tptp.d 6) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))))) (and (>= tptp.c 3) (= tptp.d 6) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule not_not)
% 0.61/0.85  (step t1217 (cl (= (and (>= tptp.c 3) (= tptp.d 6) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) false) (and (>= tptp.c 3) (= tptp.d 6) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule resolution :premises (t1215 t1216))
% 0.61/0.85  (step t1218 (cl (=> (and (>= tptp.c 3) (= tptp.d 6) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) false) (and (>= tptp.c 3) (= tptp.d 6) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule implies_neg1)
% 0.61/0.85  (anchor :step t1219)
% 0.61/0.85  (assume t1219.a0 (>= tptp.c 3))
% 0.61/0.85  (assume t1219.a1 (= tptp.d 6))
% 0.61/0.85  (assume t1219.a2 (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)))
% 0.61/0.85  (assume t1219.a3 (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))
% 0.61/0.85  (step t1219.t1 (cl (not (= (< (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)))) (not (< (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule equiv_pos2)
% 0.61/0.85  (step t1219.t2 (cl (= (< (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)))) :rule all_simplify)
% 0.61/0.85  (step t1219.t3 (cl (not (= (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (< (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (not (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (< (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) :rule equiv_pos2)
% 0.61/0.85  (step t1219.t4 (cl (= (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (< (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule symm :premises (t1219.t2))
% 0.61/0.85  (step t1219.t5 (cl (=> (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) false) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) :rule implies_neg1)
% 0.61/0.85  (anchor :step t1219.t6)
% 0.61/0.85  (assume t1219.t6.a0 (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))
% 0.61/0.85  (step t1219.t6.t1 (cl (not (= (< (+ (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 1.0 (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 2.0 tptp.d) (* (- 2.0) tptp.c)) (+ (* (- 1.0) 7) (* 1.0 1) (* 2.0 6) (* (- 2.0) 3))) false)) (not (< (+ (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 1.0 (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 2.0 tptp.d) (* (- 2.0) tptp.c)) (+ (* (- 1.0) 7) (* 1.0 1) (* 2.0 6) (* (- 2.0) 3)))) false) :rule equiv_pos2)
% 0.61/0.85  (step t1219.t6.t2 (cl (= (< (+ (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 1.0 (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 2.0 tptp.d) (* (- 2.0) tptp.c)) (+ (* (- 1.0) 7) (* 1.0 1) (* 2.0 6) (* (- 2.0) 3))) (not (>= (+ (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 1.0 (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 2.0 tptp.d) (* (- 2.0) tptp.c)) (+ (* (- 1.0) 7) (* 1.0 1) (* 2.0 6) (* (- 2.0) 3)))))) :rule all_simplify)
% 0.61/0.85  (step t1219.t6.t3 (cl (= (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (to_real (+ (* (- 2) tptp.d) (* (- 3) tptp.c) (* tptp.d tptp.c))))) :rule all_simplify)
% 0.61/0.85  (step t1219.t6.t4 (cl (= (* 1.0 (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (to_real (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c)))))) :rule all_simplify)
% 0.61/0.85  (step t1219.t6.t5 (cl (= (* 2.0 tptp.d) (to_real (* 2 tptp.d)))) :rule all_simplify)
% 0.61/0.85  (step t1219.t6.t6 (cl (= (* (- 2.0) tptp.c) (to_real (* (- 2) tptp.c)))) :rule all_simplify)
% 0.61/0.85  (step t1219.t6.t7 (cl (= (+ (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 1.0 (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 2.0 tptp.d) (* (- 2.0) tptp.c)) (+ (to_real (+ (* (- 2) tptp.d) (* (- 3) tptp.c) (* tptp.d tptp.c))) (to_real (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (to_real (* 2 tptp.d)) (to_real (* (- 2) tptp.c))))) :rule cong :premises (t1219.t6.t3 t1219.t6.t4 t1219.t6.t5 t1219.t6.t6))
% 0.61/0.85  (step t1219.t6.t8 (cl (= (+ (to_real (+ (* (- 2) tptp.d) (* (- 3) tptp.c) (* tptp.d tptp.c))) (to_real (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (to_real (* 2 tptp.d)) (to_real (* (- 2) tptp.c))) 0.0)) :rule all_simplify)
% 0.61/0.85  (step t1219.t6.t9 (cl (= (+ (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 1.0 (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 2.0 tptp.d) (* (- 2.0) tptp.c)) 0.0)) :rule trans :premises (t1219.t6.t7 t1219.t6.t8))
% 0.61/0.85  (step t1219.t6.t10 (cl (= (* (- 1.0) 7) (- 7.0))) :rule all_simplify)
% 0.61/0.85  (step t1219.t6.t11 (cl (= (* 1.0 1) 1.0)) :rule all_simplify)
% 0.61/0.85  (step t1219.t6.t12 (cl (= (* 2.0 6) 12.0)) :rule all_simplify)
% 0.61/0.85  (step t1219.t6.t13 (cl (= (* (- 2.0) 3) (- 6.0))) :rule all_simplify)
% 0.61/0.85  (step t1219.t6.t14 (cl (= (+ (* (- 1.0) 7) (* 1.0 1) (* 2.0 6) (* (- 2.0) 3)) (+ (- 7.0) 1.0 12.0 (- 6.0)))) :rule cong :premises (t1219.t6.t10 t1219.t6.t11 t1219.t6.t12 t1219.t6.t13))
% 0.61/0.85  (step t1219.t6.t15 (cl (= (+ (- 7.0) 1.0 12.0 (- 6.0)) 0.0)) :rule all_simplify)
% 0.61/0.85  (step t1219.t6.t16 (cl (= (+ (* (- 1.0) 7) (* 1.0 1) (* 2.0 6) (* (- 2.0) 3)) 0.0)) :rule trans :premises (t1219.t6.t14 t1219.t6.t15))
% 0.61/0.85  (step t1219.t6.t17 (cl (= (>= (+ (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 1.0 (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 2.0 tptp.d) (* (- 2.0) tptp.c)) (+ (* (- 1.0) 7) (* 1.0 1) (* 2.0 6) (* (- 2.0) 3))) (>= 0.0 0.0))) :rule cong :premises (t1219.t6.t9 t1219.t6.t16))
% 0.61/0.85  (step t1219.t6.t18 (cl (= (>= 0.0 0.0) true)) :rule all_simplify)
% 0.61/0.85  (step t1219.t6.t19 (cl (= (>= (+ (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 1.0 (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 2.0 tptp.d) (* (- 2.0) tptp.c)) (+ (* (- 1.0) 7) (* 1.0 1) (* 2.0 6) (* (- 2.0) 3))) true)) :rule trans :premises (t1219.t6.t17 t1219.t6.t18))
% 0.61/0.85  (step t1219.t6.t20 (cl (= (not (>= (+ (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 1.0 (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 2.0 tptp.d) (* (- 2.0) tptp.c)) (+ (* (- 1.0) 7) (* 1.0 1) (* 2.0 6) (* (- 2.0) 3)))) (not true))) :rule cong :premises (t1219.t6.t19))
% 0.61/0.85  (step t1219.t6.t21 (cl (= (not true) false)) :rule all_simplify)
% 0.61/0.85  (step t1219.t6.t22 (cl (= (not (>= (+ (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 1.0 (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 2.0 tptp.d) (* (- 2.0) tptp.c)) (+ (* (- 1.0) 7) (* 1.0 1) (* 2.0 6) (* (- 2.0) 3)))) false)) :rule trans :premises (t1219.t6.t20 t1219.t6.t21))
% 0.61/0.85  (step t1219.t6.t23 (cl (= (< (+ (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 1.0 (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 2.0 tptp.d) (* (- 2.0) tptp.c)) (+ (* (- 1.0) 7) (* 1.0 1) (* 2.0 6) (* (- 2.0) 3))) false)) :rule trans :premises (t1219.t6.t2 t1219.t6.t22))
% 0.61/0.85  (step t1219.t6.t24 (cl (not (<= (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) 7))) (not (< (* 1.0 (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 1.0 1))) (not (= (* 2.0 tptp.d) (* 2.0 6))) (not (<= (* (- 2.0) tptp.c) (* (- 2.0) 3))) (< (+ (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 1.0 (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 2.0 tptp.d) (* (- 2.0) tptp.c)) (+ (* (- 1.0) 7) (* 1.0 1) (* 2.0 6) (* (- 2.0) 3)))) :rule la_generic :args (1 1 (- 1) 1 1))
% 0.61/0.85  (step t1219.t6.t25 (cl (=> (and (< (- 1.0) 0) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (<= (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) 7)))) :rule la_mult_neg)
% 0.61/0.85  (step t1219.t6.t26 (cl (not (and (< (- 1.0) 0) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (<= (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) 7))) :rule implies :premises (t1219.t6.t25))
% 0.61/0.85  (step t1219.t6.t27 (cl (and (< (- 1.0) 0) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (< (- 1.0) 0)) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule and_neg)
% 0.61/0.85  (step t1219.t6.t28 (cl (= (= (< (- 1.0) 0) true) (< (- 1.0) 0))) :rule equiv_simplify)
% 0.61/0.85  (step t1219.t6.t29 (cl (not (= (< (- 1.0) 0) true)) (< (- 1.0) 0)) :rule equiv1 :premises (t1219.t6.t28))
% 0.61/0.85  (step t1219.t6.t30 (cl (= (< (- 1.0) 0) true)) :rule hole :args ((< (- 1.0) 0)))
% 0.61/0.85  (step t1219.t6.t31 (cl (< (- 1.0) 0)) :rule resolution :premises (t1219.t6.t29 t1219.t6.t30))
% 0.61/0.85  (step t1219.t6.t32 (cl (and (< (- 1.0) 0) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule resolution :premises (t1219.t6.t27 t1219.t6.t31 t1219.t6.a0))
% 0.61/0.85  (step t1219.t6.t33 (cl (<= (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* (- 1.0) 7))) :rule resolution :premises (t1219.t6.t26 t1219.t6.t32))
% 0.61/0.85  (step t1219.t6.t34 (cl (=> (and (> 1.0 0) (< (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (< (* 1.0 (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 1.0 1)))) :rule la_mult_pos)
% 0.61/0.85  (step t1219.t6.t35 (cl (not (and (> 1.0 0) (< (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (< (* 1.0 (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 1.0 1))) :rule implies :premises (t1219.t6.t34))
% 0.61/0.85  (step t1219.t6.t36 (cl (and (> 1.0 0) (< (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (> 1.0 0)) (not (< (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) :rule and_neg)
% 0.61/0.85  (step t1219.t6.t37 (cl (= (= (> 1.0 0) true) (> 1.0 0))) :rule equiv_simplify)
% 0.61/0.85  (step t1219.t6.t38 (cl (not (= (> 1.0 0) true)) (> 1.0 0)) :rule equiv1 :premises (t1219.t6.t37))
% 0.61/0.85  (step t1219.t6.t39 (cl (= (> 1.0 0) true)) :rule hole :args ((> 1.0 0)))
% 0.61/0.85  (step t1219.t6.t40 (cl (> 1.0 0)) :rule resolution :premises (t1219.t6.t38 t1219.t6.t39))
% 0.61/0.85  (step t1219.t6.t41 (cl (not (= (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (< (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (< (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) :rule equiv_pos2)
% 0.61/0.85  (step t1219.t6.t42 (cl (= (< (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)))) :rule all_simplify)
% 0.61/0.85  (step t1219.t6.t43 (cl (= (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (< (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) :rule symm :premises (t1219.t6.t42))
% 0.61/0.85  (step t1219.t6.t44 (cl (< (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) :rule resolution :premises (t1219.t6.t41 t1219.t6.t43 t1219.a2))
% 0.61/0.85  (step t1219.t6.t45 (cl (and (> 1.0 0) (< (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) :rule resolution :premises (t1219.t6.t36 t1219.t6.t40 t1219.t6.t44))
% 0.61/0.85  (step t1219.t6.t46 (cl (< (* 1.0 (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 1.0 1))) :rule resolution :premises (t1219.t6.t35 t1219.t6.t45))
% 0.61/0.85  (step t1219.t6.t47 (cl (=> (and (> 2.0 0) (= tptp.d 6)) (= (* 2.0 tptp.d) (* 2.0 6)))) :rule la_mult_pos)
% 0.61/0.85  (step t1219.t6.t48 (cl (not (and (> 2.0 0) (= tptp.d 6))) (= (* 2.0 tptp.d) (* 2.0 6))) :rule implies :premises (t1219.t6.t47))
% 0.61/0.85  (step t1219.t6.t49 (cl (and (> 2.0 0) (= tptp.d 6)) (not (> 2.0 0)) (not (= tptp.d 6))) :rule and_neg)
% 0.61/0.85  (step t1219.t6.t50 (cl (= (= (> 2.0 0) true) (> 2.0 0))) :rule equiv_simplify)
% 0.61/0.85  (step t1219.t6.t51 (cl (not (= (> 2.0 0) true)) (> 2.0 0)) :rule equiv1 :premises (t1219.t6.t50))
% 0.61/0.85  (step t1219.t6.t52 (cl (= (> 2.0 0) true)) :rule hole :args ((> 2.0 0)))
% 0.61/0.85  (step t1219.t6.t53 (cl (> 2.0 0)) :rule resolution :premises (t1219.t6.t51 t1219.t6.t52))
% 0.61/0.85  (step t1219.t6.t54 (cl (and (> 2.0 0) (= tptp.d 6))) :rule resolution :premises (t1219.t6.t49 t1219.t6.t53 t1219.a1))
% 0.61/0.85  (step t1219.t6.t55 (cl (= (* 2.0 tptp.d) (* 2.0 6))) :rule resolution :premises (t1219.t6.t48 t1219.t6.t54))
% 0.61/0.85  (step t1219.t6.t56 (cl (=> (and (< (- 2.0) 0) (>= tptp.c 3)) (<= (* (- 2.0) tptp.c) (* (- 2.0) 3)))) :rule la_mult_neg)
% 0.61/0.85  (step t1219.t6.t57 (cl (not (and (< (- 2.0) 0) (>= tptp.c 3))) (<= (* (- 2.0) tptp.c) (* (- 2.0) 3))) :rule implies :premises (t1219.t6.t56))
% 0.61/0.85  (step t1219.t6.t58 (cl (and (< (- 2.0) 0) (>= tptp.c 3)) (not (< (- 2.0) 0)) (not (>= tptp.c 3))) :rule and_neg)
% 0.61/0.85  (step t1219.t6.t59 (cl (= (= (< (- 2.0) 0) true) (< (- 2.0) 0))) :rule equiv_simplify)
% 0.61/0.85  (step t1219.t6.t60 (cl (not (= (< (- 2.0) 0) true)) (< (- 2.0) 0)) :rule equiv1 :premises (t1219.t6.t59))
% 0.61/0.85  (step t1219.t6.t61 (cl (= (< (- 2.0) 0) true)) :rule hole :args ((< (- 2.0) 0)))
% 0.61/0.85  (step t1219.t6.t62 (cl (< (- 2.0) 0)) :rule resolution :premises (t1219.t6.t60 t1219.t6.t61))
% 0.61/0.85  (step t1219.t6.t63 (cl (and (< (- 2.0) 0) (>= tptp.c 3))) :rule resolution :premises (t1219.t6.t58 t1219.t6.t62 t1219.a0))
% 0.61/0.85  (step t1219.t6.t64 (cl (<= (* (- 2.0) tptp.c) (* (- 2.0) 3))) :rule resolution :premises (t1219.t6.t57 t1219.t6.t63))
% 0.61/0.85  (step t1219.t6.t65 (cl (< (+ (* (- 1.0) (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 1.0 (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c)))) (* 2.0 tptp.d) (* (- 2.0) tptp.c)) (+ (* (- 1.0) 7) (* 1.0 1) (* 2.0 6) (* (- 2.0) 3)))) :rule resolution :premises (t1219.t6.t24 t1219.t6.t33 t1219.t6.t46 t1219.t6.t55 t1219.t6.t64))
% 0.61/0.85  (step t1219.t6.t66 (cl false) :rule resolution :premises (t1219.t6.t1 t1219.t6.t23 t1219.t6.t65))
% 0.61/0.85  (step t1219.t6 (cl (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) false) :rule subproof :discharge (t1219.t6.a0))
% 0.61/0.85  (step t1219.t7 (cl (=> (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) false) false) :rule resolution :premises (t1219.t5 t1219.t6))
% 0.61/0.85  (step t1219.t8 (cl (=> (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) false) (not false)) :rule implies_neg2)
% 0.61/0.85  (step t1219.t9 (cl (=> (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) false) (=> (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) false)) :rule resolution :premises (t1219.t7 t1219.t8))
% 0.61/0.85  (step t1219.t10 (cl (=> (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) false)) :rule contraction :premises (t1219.t9))
% 0.61/0.85  (step t1219.t11 (cl (= (=> (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) false) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)))) :rule implies_simplify)
% 0.61/0.85  (step t1219.t12 (cl (not (=> (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) false)) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule equiv1 :premises (t1219.t11))
% 0.61/0.85  (step t1219.t13 (cl (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule resolution :premises (t1219.t10 t1219.t12))
% 0.61/0.85  (step t1219.t14 (cl (< (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) :rule resolution :premises (t1219.t3 t1219.t4 t1219.t13))
% 0.61/0.85  (step t1219.t15 (cl (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule resolution :premises (t1219.t1 t1219.t2 t1219.t14))
% 0.61/0.85  (step t1219.t16 (cl) :rule resolution :premises (t1219.a3 t1219.t15))
% 0.61/0.85  (step t1219 (cl (not (>= tptp.c 3)) (not (= tptp.d 6)) (not (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) false) :rule subproof :discharge (t1219.a0 t1219.a1 t1219.a2 t1219.a3))
% 0.61/0.85  (step t1220 (cl (not (and (>= tptp.c 3) (= tptp.d 6) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (>= tptp.c 3)) :rule and_pos)
% 0.61/0.85  (step t1221 (cl (not (and (>= tptp.c 3) (= tptp.d 6) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (= tptp.d 6)) :rule and_pos)
% 0.61/0.85  (step t1222 (cl (not (and (>= tptp.c 3) (= tptp.d 6) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) :rule and_pos)
% 0.61/0.85  (step t1223 (cl (not (and (>= tptp.c 3) (= tptp.d 6) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) :rule and_pos)
% 0.61/0.85  (step t1224 (cl false (not (and (>= tptp.c 3) (= tptp.d 6) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (not (and (>= tptp.c 3) (= tptp.d 6) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (not (and (>= tptp.c 3) (= tptp.d 6) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (not (and (>= tptp.c 3) (= tptp.d 6) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)))) :rule resolution :premises (t1219 t1220 t1221 t1222 t1223))
% 0.61/0.85  (step t1225 (cl (not (and (>= tptp.c 3) (= tptp.d 6) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (not (and (>= tptp.c 3) (= tptp.d 6) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (not (and (>= tptp.c 3) (= tptp.d 6) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (not (and (>= tptp.c 3) (= tptp.d 6) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) false) :rule reordering :premises (t1224))
% 0.61/0.85  (step t1226 (cl (not (and (>= tptp.c 3) (= tptp.d 6) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) false) :rule contraction :premises (t1225))
% 0.61/0.85  (step t1227 (cl (=> (and (>= tptp.c 3) (= tptp.d 6) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) false) false) :rule resolution :premises (t1218 t1226))
% 0.61/0.85  (step t1228 (cl (=> (and (>= tptp.c 3) (= tptp.d 6) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) false) (not false)) :rule implies_neg2)
% 0.61/0.85  (step t1229 (cl (=> (and (>= tptp.c 3) (= tptp.d 6) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) false) (=> (and (>= tptp.c 3) (= tptp.d 6) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) false)) :rule resolution :premises (t1227 t1228))
% 0.61/0.85  (step t1230 (cl (=> (and (>= tptp.c 3) (= tptp.d 6) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) false)) :rule contraction :premises (t1229))
% 0.61/0.85  (step t1231 (cl (= (=> (and (>= tptp.c 3) (= tptp.d 6) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) false) (not (and (>= tptp.c 3) (= tptp.d 6) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))))) :rule implies_simplify)
% 0.61/0.85  (step t1232 (cl (not (=> (and (>= tptp.c 3) (= tptp.d 6) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) false)) (not (and (>= tptp.c 3) (= tptp.d 6) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)))) :rule equiv1 :premises (t1231))
% 0.61/0.85  (step t1233 (cl (not (and (>= tptp.c 3) (= tptp.d 6) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)))) :rule resolution :premises (t1230 t1232))
% 0.61/0.85  (step t1234 (cl (= (and (>= tptp.c 3) (= tptp.d 6) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) false)) :rule resolution :premises (t1217 t1233))
% 0.61/0.85  (step t1235 (cl (= (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.d 6) (>= tptp.c 3)) (and (>= tptp.c 3) (= tptp.d 6) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.d 6) (>= tptp.c 3)) false))) :rule cong :premises (t1213 t1234))
% 0.61/0.85  (step t1236 (cl (= (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.d 6) (>= tptp.c 3)) false) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.d 6) (>= tptp.c 3))))) :rule all_simplify)
% 0.61/0.85  (step t1237 (cl (= (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.d 6) (>= tptp.c 3)) (and (>= tptp.c 3) (= tptp.d 6) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.d 6) (>= tptp.c 3))))) :rule trans :premises (t1235 t1236))
% 0.61/0.85  (step t1238 (cl (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.d 6) (>= tptp.c 3)) (and (>= tptp.c 3) (= tptp.d 6) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.d 6) (>= tptp.c 3))) :rule implies_neg1)
% 0.61/0.85  (anchor :step t1239)
% 0.61/0.85  (assume t1239.a0 (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))
% 0.61/0.85  (assume t1239.a1 (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)))
% 0.61/0.85  (assume t1239.a2 (= tptp.d 6))
% 0.61/0.85  (assume t1239.a3 (>= tptp.c 3))
% 0.61/0.85  (step t1239.t1 (cl (and (>= tptp.c 3) (= tptp.d 6) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (>= tptp.c 3)) (not (= tptp.d 6)) (not (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule and_neg)
% 0.61/0.85  (step t1239.t2 (cl (and (>= tptp.c 3) (= tptp.d 6) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule resolution :premises (t1239.t1 t1239.a3 t1239.a2 t1239.a1 t1239.a0))
% 0.61/0.85  (step t1239 (cl (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (= tptp.d 6)) (not (>= tptp.c 3)) (and (>= tptp.c 3) (= tptp.d 6) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule subproof :discharge (t1239.a0 t1239.a1 t1239.a2 t1239.a3))
% 0.61/0.85  (step t1240 (cl (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.d 6) (>= tptp.c 3))) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) :rule and_pos)
% 0.61/0.85  (step t1241 (cl (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.d 6) (>= tptp.c 3))) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) :rule and_pos)
% 0.61/0.85  (step t1242 (cl (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.d 6) (>= tptp.c 3))) (= tptp.d 6)) :rule and_pos)
% 0.61/0.85  (step t1243 (cl (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.d 6) (>= tptp.c 3))) (>= tptp.c 3)) :rule and_pos)
% 0.61/0.85  (step t1244 (cl (and (>= tptp.c 3) (= tptp.d 6) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.d 6) (>= tptp.c 3))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.d 6) (>= tptp.c 3))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.d 6) (>= tptp.c 3))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.d 6) (>= tptp.c 3)))) :rule resolution :premises (t1239 t1240 t1241 t1242 t1243))
% 0.61/0.85  (step t1245 (cl (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.d 6) (>= tptp.c 3))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.d 6) (>= tptp.c 3))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.d 6) (>= tptp.c 3))) (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.d 6) (>= tptp.c 3))) (and (>= tptp.c 3) (= tptp.d 6) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule reordering :premises (t1244))
% 0.61/0.85  (step t1246 (cl (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.d 6) (>= tptp.c 3))) (and (>= tptp.c 3) (= tptp.d 6) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule contraction :premises (t1245))
% 0.61/0.85  (step t1247 (cl (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.d 6) (>= tptp.c 3)) (and (>= tptp.c 3) (= tptp.d 6) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (and (>= tptp.c 3) (= tptp.d 6) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) :rule resolution :premises (t1238 t1246))
% 0.61/0.85  (step t1248 (cl (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.d 6) (>= tptp.c 3)) (and (>= tptp.c 3) (= tptp.d 6) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (not (and (>= tptp.c 3) (= tptp.d 6) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)))) :rule implies_neg2)
% 0.61/0.85  (step t1249 (cl (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.d 6) (>= tptp.c 3)) (and (>= tptp.c 3) (= tptp.d 6) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7))) (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.d 6) (>= tptp.c 3)) (and (>= tptp.c 3) (= tptp.d 6) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)))) :rule resolution :premises (t1247 t1248))
% 0.61/0.86  (step t1250 (cl (=> (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.d 6) (>= tptp.c 3)) (and (>= tptp.c 3) (= tptp.d 6) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)))) :rule contraction :premises (t1249))
% 0.61/0.86  (step t1251 (cl (not (and (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (= tptp.d 6) (>= tptp.c 3)))) :rule resolution :premises (t1212 t1237 t1250))
% 0.61/0.86  (step t1252 (cl (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (= tptp.d 6)) (not (>= tptp.c 3))) :rule not_and :premises (t1251))
% 0.61/0.86  (step t1253 (cl (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (= tptp.d 6)) (not (>= tptp.c 3))) (not (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)))) :rule or_neg)
% 0.61/0.86  (step t1254 (cl (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (= tptp.d 6)) (not (>= tptp.c 3))) (not (not (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))))) :rule or_neg)
% 0.61/0.86  (step t1255 (cl (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (= tptp.d 6)) (not (>= tptp.c 3))) (not (not (= tptp.d 6)))) :rule or_neg)
% 0.61/0.86  (step t1256 (cl (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (= tptp.d 6)) (not (>= tptp.c 3))) (not (not (>= tptp.c 3)))) :rule or_neg)
% 0.61/0.86  (step t1257 (cl (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (= tptp.d 6)) (not (>= tptp.c 3))) (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (= tptp.d 6)) (not (>= tptp.c 3))) (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (= tptp.d 6)) (not (>= tptp.c 3))) (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (= tptp.d 6)) (not (>= tptp.c 3)))) :rule resolution :premises (t1252 t1253 t1254 t1255 t1256))
% 0.61/0.86  (step t1258 (cl (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (not (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (not (= tptp.d 6)) (not (>= tptp.c 3)))) :rule contraction :premises (t1257))
% 0.61/0.86  (step t1259 (cl (or (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1) (not (= tptp.d 6)) (not (>= tptp.c 3)))) :rule resolution :premises (t1209 t1211 t1258))
% 0.61/0.86  (step t1260 (cl (not (>= (+ (* 2 tptp.d) (* 3 tptp.c) (* (- 1) (* tptp.d tptp.c))) 7)) (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1) (not (= tptp.d 6)) (not (>= tptp.c 3))) :rule or :premises (t1259))
% 0.61/0.86  (step t1261 (cl (not (>= tptp.c 3)) (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1) (not (>= tptp.c 3)) (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1) (not (>= tptp.c 3))) :rule resolution :premises (t1136 t1208 t202 t1260 t202))
% 0.61/0.86  (step t1262 (cl (not (>= tptp.c 3)) (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) :rule contraction :premises (t1261))
% 0.61/0.86  (step t1263 (cl (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1) (not (>= tptp.c 3))) :rule reordering :premises (t1262))
% 0.61/0.86  (step t1264 (cl (not (= (=> (and (> tptp.c 0) (>= tptp.d 5)) (>= (* tptp.c tptp.d) (* tptp.c (* (- 1) (- 5))))) (=> (and (>= tptp.c 1) (>= tptp.d 5)) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))))) (not (=> (and (> tptp.c 0) (>= tptp.d 5)) (>= (* tptp.c tptp.d) (* tptp.c (* (- 1) (- 5)))))) (=> (and (>= tptp.c 1) (>= tptp.d 5)) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)))) :rule equiv_pos2)
% 0.61/0.86  (step t1265 (cl (= (>= tptp.d 5) (>= tptp.d 5))) :rule refl)
% 0.61/0.86  (step t1266 (cl (= (and (> tptp.c 0) (>= tptp.d 5)) (and (>= tptp.c 1) (>= tptp.d 5)))) :rule cong :premises (t1030 t1265))
% 0.61/0.86  (step t1267 (cl (= (* (- 1) (- 5)) 5)) :rule all_simplify)
% 0.61/0.86  (step t1268 (cl (= (* tptp.c (* (- 1) (- 5))) (* tptp.c 5))) :rule cong :premises (t135 t1267))
% 0.61/0.86  (step t1269 (cl (= (* tptp.c 5) (* 5 tptp.c))) :rule all_simplify)
% 0.61/0.86  (step t1270 (cl (= (* tptp.c (* (- 1) (- 5))) (* 5 tptp.c))) :rule trans :premises (t1268 t1269))
% 0.61/0.86  (step t1271 (cl (= (>= (* tptp.c tptp.d) (* tptp.c (* (- 1) (- 5)))) (>= (* tptp.d tptp.c) (* 5 tptp.c)))) :rule cong :premises (t120 t1270))
% 0.61/0.86  (step t1272 (cl (= (>= (* tptp.d tptp.c) (* 5 tptp.c)) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)))) :rule all_simplify)
% 0.61/0.86  (step t1273 (cl (= (>= (* tptp.c tptp.d) (* tptp.c (* (- 1) (- 5)))) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)))) :rule trans :premises (t1271 t1272))
% 0.61/0.86  (step t1274 (cl (= (=> (and (> tptp.c 0) (>= tptp.d 5)) (>= (* tptp.c tptp.d) (* tptp.c (* (- 1) (- 5))))) (=> (and (>= tptp.c 1) (>= tptp.d 5)) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))))) :rule cong :premises (t1266 t1273))
% 0.61/0.86  (step t1275 (cl (not (= (=> (and (> tptp.c 0) (>= tptp.d (* (- 1) (- 5)))) (>= (* tptp.c tptp.d) (* tptp.c (* (- 1) (- 5))))) (=> (and (> tptp.c 0) (>= tptp.d 5)) (>= (* tptp.c tptp.d) (* tptp.c (* (- 1) (- 5))))))) (not (=> (and (> tptp.c 0) (>= tptp.d (* (- 1) (- 5)))) (>= (* tptp.c tptp.d) (* tptp.c (* (- 1) (- 5)))))) (=> (and (> tptp.c 0) (>= tptp.d 5)) (>= (* tptp.c tptp.d) (* tptp.c (* (- 1) (- 5)))))) :rule equiv_pos2)
% 0.61/0.86  (step t1276 (cl (= (>= tptp.d (* (- 1) (- 5))) (>= tptp.d 5))) :rule cong :premises (t126 t1267))
% 0.61/0.86  (step t1277 (cl (= (and (> tptp.c 0) (>= tptp.d (* (- 1) (- 5)))) (and (>= tptp.c 1) (>= tptp.d 5)))) :rule cong :premises (t1030 t1276))
% 0.61/0.86  (step t1278 (cl (= (=> (and (> tptp.c 0) (>= tptp.d (* (- 1) (- 5)))) (>= (* tptp.c tptp.d) (* tptp.c (* (- 1) (- 5))))) (=> (and (>= tptp.c 1) (>= tptp.d 5)) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))))) :rule cong :premises (t1277 t1273))
% 0.61/0.86  (step t1279 (cl (= (=> (and (> tptp.c 0) (>= tptp.d 5)) (>= (* tptp.c tptp.d) (* tptp.c (* (- 1) (- 5))))) (=> (and (>= tptp.c 1) (>= tptp.d 5)) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))))) :rule cong :premises (t1266 t1273))
% 0.61/0.86  (step t1280 (cl (= (=> (and (>= tptp.c 1) (>= tptp.d 5)) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) (=> (and (> tptp.c 0) (>= tptp.d 5)) (>= (* tptp.c tptp.d) (* tptp.c (* (- 1) (- 5))))))) :rule symm :premises (t1279))
% 0.61/0.86  (step t1281 (cl (= (=> (and (> tptp.c 0) (>= tptp.d (* (- 1) (- 5)))) (>= (* tptp.c tptp.d) (* tptp.c (* (- 1) (- 5))))) (=> (and (> tptp.c 0) (>= tptp.d 5)) (>= (* tptp.c tptp.d) (* tptp.c (* (- 1) (- 5))))))) :rule trans :premises (t1278 t1280))
% 0.61/0.86  (step t1282 (cl (=> (and (> tptp.c 0) (>= tptp.d (* (- 1) (- 5)))) (>= (* tptp.c tptp.d) (* tptp.c (* (- 1) (- 5)))))) :rule la_mult_pos)
% 0.61/0.86  (step t1283 (cl (=> (and (> tptp.c 0) (>= tptp.d 5)) (>= (* tptp.c tptp.d) (* tptp.c (* (- 1) (- 5)))))) :rule resolution :premises (t1275 t1281 t1282))
% 0.61/0.86  (step t1284 (cl (=> (and (>= tptp.c 1) (>= tptp.d 5)) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)))) :rule resolution :premises (t1264 t1274 t1283))
% 0.61/0.86  (step t1285 (cl (not (and (>= tptp.c 1) (>= tptp.d 5))) (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) :rule implies :premises (t1284))
% 0.61/0.86  (step t1286 (cl (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1)) (not (and (>= tptp.c 1) (>= tptp.d 5)))) :rule reordering :premises (t1285))
% 0.61/0.86  (step t1287 (cl (and (>= tptp.c 1) (>= tptp.d 5)) (not (>= tptp.c 1)) (not (>= tptp.d 5))) :rule and_neg)
% 0.61/0.86  (step t1288 (cl (not (>= tptp.d 5)) (not (>= tptp.c 1)) (and (>= tptp.c 1) (>= tptp.d 5))) :rule reordering :premises (t1287))
% 0.61/0.86  (step t1289 (cl (and (>= tptp.c 1) (>= tptp.d 5))) :rule resolution :premises (t1288 t501 t633))
% 0.61/0.86  (step t1290 (cl (not (>= (+ (* 5 tptp.c) (* (- 1) (* tptp.d tptp.c))) 1))) :rule resolution :premises (t1286 t1289))
% 0.61/0.86  (step t1291 (cl (not (>= tptp.c 3))) :rule resolution :premises (t1263 t1290))
% 0.61/0.86  (step t1292 (cl) :rule resolution :premises (t44 t505 t1291 t195))
% 0.61/0.86  
% 0.61/0.86  % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.UZtCu3i4OM/cvc5---1.0.5_14743.smt2
% 0.61/0.86  % cvc5---1.0.5 exiting
% 0.61/0.86  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------