TSTP Solution File: ARI659_1 by cvc5---1.0.5

View Problem - Process Solution

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

% Computer : n029.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:24 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : ARI659_1 : TPTP v8.2.0. Released v6.3.0.
% 0.07/0.14  % Command    : do_cvc5 %s %d
% 0.13/0.35  % Computer : n029.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Mon May 27 05:13:09 EDT 2024
% 0.13/0.35  % CPUTime    : 
% 0.19/0.48  %----Proving TF0_ARI
% 0.34/0.61  --- Run --finite-model-find --decision=internal at 15...
% 0.34/0.61  % SZS status Theorem for /export/starexec/sandbox/tmp/tmp.8ok2jchqXr/cvc5---1.0.5_4442.smt2
% 0.34/0.61  % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.8ok2jchqXr/cvc5---1.0.5_4442.smt2
% 0.34/0.61  (assume a0 (not (= (>= 3 (* (* tptp.a tptp.a) tptp.a)) (<= tptp.a 1))))
% 0.34/0.61  (assume a1 true)
% 0.34/0.61  (step t1 (cl (not (= (or (not (not (>= tptp.a 0))) (not (>= (* tptp.a tptp.a tptp.a) 0))) (or (>= tptp.a 0) (not (>= (* tptp.a tptp.a tptp.a) 0))))) (not (or (not (not (>= tptp.a 0))) (not (>= (* tptp.a tptp.a tptp.a) 0)))) (or (>= tptp.a 0) (not (>= (* tptp.a tptp.a tptp.a) 0)))) :rule equiv_pos2)
% 0.34/0.61  (step t2 (cl (= (= (= (not (not (>= tptp.a 0))) (>= tptp.a 0)) true) (= (not (not (>= tptp.a 0))) (>= tptp.a 0)))) :rule equiv_simplify)
% 0.34/0.61  (step t3 (cl (not (= (= (not (not (>= tptp.a 0))) (>= tptp.a 0)) true)) (= (not (not (>= tptp.a 0))) (>= tptp.a 0))) :rule equiv1 :premises (t2))
% 0.34/0.61  (step t4 (cl (= (= (not (not (>= tptp.a 0))) (>= tptp.a 0)) (= (>= tptp.a 0) (not (not (>= tptp.a 0)))))) :rule all_simplify)
% 0.34/0.61  (step t5 (cl (= (>= tptp.a 0) (>= tptp.a 0))) :rule refl)
% 0.34/0.61  (step t6 (cl (= (not (not (>= tptp.a 0))) (>= tptp.a 0))) :rule all_simplify)
% 0.34/0.61  (step t7 (cl (= (= (>= tptp.a 0) (not (not (>= tptp.a 0)))) (= (>= tptp.a 0) (>= tptp.a 0)))) :rule cong :premises (t5 t6))
% 0.34/0.61  (step t8 (cl (= (= (>= tptp.a 0) (>= tptp.a 0)) true)) :rule all_simplify)
% 0.34/0.61  (step t9 (cl (= (= (>= tptp.a 0) (not (not (>= tptp.a 0)))) true)) :rule trans :premises (t7 t8))
% 0.34/0.61  (step t10 (cl (= (= (not (not (>= tptp.a 0))) (>= tptp.a 0)) true)) :rule trans :premises (t4 t9))
% 0.34/0.61  (step t11 (cl (= (not (not (>= tptp.a 0))) (>= tptp.a 0))) :rule resolution :premises (t3 t10))
% 0.34/0.61  (step t12 (cl (= (not (>= (* tptp.a tptp.a tptp.a) 0)) (not (>= (* tptp.a tptp.a tptp.a) 0)))) :rule refl)
% 0.34/0.61  (step t13 (cl (= (or (not (not (>= tptp.a 0))) (not (>= (* tptp.a tptp.a tptp.a) 0))) (or (>= tptp.a 0) (not (>= (* tptp.a tptp.a tptp.a) 0))))) :rule cong :premises (t11 t12))
% 0.34/0.61  (step t14 (cl (not (= (=> (< tptp.a 0) (> 0 (* tptp.a tptp.a tptp.a))) (=> (not (>= tptp.a 0)) (not (>= (* tptp.a tptp.a tptp.a) 0))))) (not (=> (< tptp.a 0) (> 0 (* tptp.a tptp.a tptp.a)))) (=> (not (>= tptp.a 0)) (not (>= (* tptp.a tptp.a tptp.a) 0)))) :rule equiv_pos2)
% 0.34/0.61  (step t15 (cl (= (< tptp.a 0) (not (>= tptp.a 0)))) :rule all_simplify)
% 0.34/0.61  (step t16 (cl (= (> 0 (* tptp.a tptp.a tptp.a)) (not (<= 0 (* tptp.a tptp.a tptp.a))))) :rule all_simplify)
% 0.34/0.61  (step t17 (cl (= (<= 0 (* tptp.a tptp.a tptp.a)) (>= (* tptp.a tptp.a tptp.a) 0))) :rule all_simplify)
% 0.34/0.61  (step t18 (cl (= (not (<= 0 (* tptp.a tptp.a tptp.a))) (not (>= (* tptp.a tptp.a tptp.a) 0)))) :rule cong :premises (t17))
% 0.34/0.61  (step t19 (cl (= (> 0 (* tptp.a tptp.a tptp.a)) (not (>= (* tptp.a tptp.a tptp.a) 0)))) :rule trans :premises (t16 t18))
% 0.34/0.61  (step t20 (cl (= (=> (< tptp.a 0) (> 0 (* tptp.a tptp.a tptp.a))) (=> (not (>= tptp.a 0)) (not (>= (* tptp.a tptp.a tptp.a) 0))))) :rule cong :premises (t15 t19))
% 0.34/0.61  (step t21 (cl (=> (< tptp.a 0) (> 0 (* tptp.a tptp.a tptp.a)))) :rule hole :args ((< tptp.a 0) (* tptp.a tptp.a tptp.a)))
% 0.34/0.61  (step t22 (cl (=> (not (>= tptp.a 0)) (not (>= (* tptp.a tptp.a tptp.a) 0)))) :rule resolution :premises (t14 t20 t21))
% 0.34/0.61  (step t23 (cl (not (not (>= tptp.a 0))) (not (>= (* tptp.a tptp.a tptp.a) 0))) :rule implies :premises (t22))
% 0.34/0.61  (step t24 (cl (or (not (not (>= tptp.a 0))) (not (>= (* tptp.a tptp.a tptp.a) 0))) (not (not (not (>= tptp.a 0))))) :rule or_neg)
% 0.34/0.61  (step t25 (cl (or (not (not (>= tptp.a 0))) (not (>= (* tptp.a tptp.a tptp.a) 0))) (not (not (>= (* tptp.a tptp.a tptp.a) 0)))) :rule or_neg)
% 0.34/0.61  (step t26 (cl (or (not (not (>= tptp.a 0))) (not (>= (* tptp.a tptp.a tptp.a) 0))) (or (not (not (>= tptp.a 0))) (not (>= (* tptp.a tptp.a tptp.a) 0)))) :rule resolution :premises (t23 t24 t25))
% 0.34/0.61  (step t27 (cl (or (not (not (>= tptp.a 0))) (not (>= (* tptp.a tptp.a tptp.a) 0)))) :rule contraction :premises (t26))
% 0.34/0.61  (step t28 (cl (or (>= tptp.a 0) (not (>= (* tptp.a tptp.a tptp.a) 0)))) :rule resolution :premises (t1 t13 t27))
% 0.34/0.61  (step t29 (cl (>= tptp.a 0) (not (>= (* tptp.a tptp.a tptp.a) 0))) :rule or :premises (t28))
% 0.34/0.61  (step t30 (cl (not (= (or (not (not (>= tptp.a 1))) (not (not (= tptp.a 0))) (not (>= tptp.a 0))) (or (>= tptp.a 1) (= tptp.a 0) (not (>= tptp.a 0))))) (not (or (not (not (>= tptp.a 1))) (not (not (= tptp.a 0))) (not (>= tptp.a 0)))) (or (>= tptp.a 1) (= tptp.a 0) (not (>= tptp.a 0)))) :rule equiv_pos2)
% 0.34/0.61  (step t31 (cl (= (= (= (not (not (>= tptp.a 1))) (>= tptp.a 1)) true) (= (not (not (>= tptp.a 1))) (>= tptp.a 1)))) :rule equiv_simplify)
% 0.34/0.61  (step t32 (cl (not (= (= (not (not (>= tptp.a 1))) (>= tptp.a 1)) true)) (= (not (not (>= tptp.a 1))) (>= tptp.a 1))) :rule equiv1 :premises (t31))
% 0.34/0.61  (step t33 (cl (= (= (not (not (>= tptp.a 1))) (>= tptp.a 1)) (= (>= tptp.a 1) (not (not (>= tptp.a 1)))))) :rule all_simplify)
% 0.34/0.61  (step t34 (cl (= (>= tptp.a 1) (>= tptp.a 1))) :rule refl)
% 0.34/0.61  (step t35 (cl (= (not (not (>= tptp.a 1))) (>= tptp.a 1))) :rule all_simplify)
% 0.34/0.61  (step t36 (cl (= (= (>= tptp.a 1) (not (not (>= tptp.a 1)))) (= (>= tptp.a 1) (>= tptp.a 1)))) :rule cong :premises (t34 t35))
% 0.34/0.61  (step t37 (cl (= (= (>= tptp.a 1) (>= tptp.a 1)) true)) :rule all_simplify)
% 0.34/0.61  (step t38 (cl (= (= (>= tptp.a 1) (not (not (>= tptp.a 1)))) true)) :rule trans :premises (t36 t37))
% 0.34/0.61  (step t39 (cl (= (= (not (not (>= tptp.a 1))) (>= tptp.a 1)) true)) :rule trans :premises (t33 t38))
% 0.34/0.61  (step t40 (cl (= (not (not (>= tptp.a 1))) (>= tptp.a 1))) :rule resolution :premises (t32 t39))
% 0.34/0.61  (step t41 (cl (= (= (= (not (not (= tptp.a 0))) (= tptp.a 0)) true) (= (not (not (= tptp.a 0))) (= tptp.a 0)))) :rule equiv_simplify)
% 0.34/0.61  (step t42 (cl (not (= (= (not (not (= tptp.a 0))) (= tptp.a 0)) true)) (= (not (not (= tptp.a 0))) (= tptp.a 0))) :rule equiv1 :premises (t41))
% 0.34/0.61  (step t43 (cl (= (= (not (not (= tptp.a 0))) (= tptp.a 0)) (= (= tptp.a 0) (not (not (= tptp.a 0)))))) :rule all_simplify)
% 0.34/0.61  (step t44 (cl (= (= tptp.a 0) (= tptp.a 0))) :rule refl)
% 0.34/0.61  (step t45 (cl (= (not (not (= tptp.a 0))) (= tptp.a 0))) :rule all_simplify)
% 0.34/0.61  (step t46 (cl (= (= (= tptp.a 0) (not (not (= tptp.a 0)))) (= (= tptp.a 0) (= tptp.a 0)))) :rule cong :premises (t44 t45))
% 0.34/0.61  (step t47 (cl (= (= (= tptp.a 0) (= tptp.a 0)) true)) :rule all_simplify)
% 0.34/0.61  (step t48 (cl (= (= (= tptp.a 0) (not (not (= tptp.a 0)))) true)) :rule trans :premises (t46 t47))
% 0.34/0.61  (step t49 (cl (= (= (not (not (= tptp.a 0))) (= tptp.a 0)) true)) :rule trans :premises (t43 t48))
% 0.34/0.61  (step t50 (cl (= (not (not (= tptp.a 0))) (= tptp.a 0))) :rule resolution :premises (t42 t49))
% 0.34/0.61  (step t51 (cl (= (not (>= tptp.a 0)) (not (>= tptp.a 0)))) :rule refl)
% 0.34/0.61  (step t52 (cl (= (or (not (not (>= tptp.a 1))) (not (not (= tptp.a 0))) (not (>= tptp.a 0))) (or (>= tptp.a 1) (= tptp.a 0) (not (>= tptp.a 0))))) :rule cong :premises (t40 t50 t51))
% 0.34/0.61  (step t53 (cl (and (not (>= tptp.a 1)) (not (= tptp.a 0))) (not (not (>= tptp.a 1))) (not (not (= tptp.a 0)))) :rule and_neg)
% 0.34/0.61  (step t54 (cl (=> (and (not (>= tptp.a 1)) (not (= tptp.a 0))) (not (>= tptp.a 0))) (and (not (>= tptp.a 1)) (not (= tptp.a 0)))) :rule implies_neg1)
% 0.34/0.61  (anchor :step t55)
% 0.34/0.61  (assume t55.a0 (not (>= tptp.a 1)))
% 0.34/0.61  (assume t55.a1 (not (= tptp.a 0)))
% 0.34/0.61  (step t55.t1 (cl (=> (and (not (>= tptp.a 1)) (not (= tptp.a 0))) (not (>= tptp.a 0))) (and (not (>= tptp.a 1)) (not (= tptp.a 0)))) :rule implies_neg1)
% 0.34/0.61  (anchor :step t55.t2)
% 0.34/0.61  (assume t55.t2.a0 (not (>= tptp.a 1)))
% 0.34/0.61  (assume t55.t2.a1 (not (= tptp.a 0)))
% 0.34/0.61  (step t55.t2.t1 (cl (not (= (< tptp.a 0) (not (>= tptp.a 0)))) (not (< tptp.a 0)) (not (>= tptp.a 0))) :rule equiv_pos2)
% 0.34/0.61  (step t55.t2.t2 (cl (or (= tptp.a 0) (not (<= tptp.a 0)) (not (<= 0 tptp.a)))) :rule la_disequality)
% 0.34/0.61  (step t55.t2.t3 (cl (= tptp.a 0) (not (<= tptp.a 0)) (not (<= 0 tptp.a))) :rule or :premises (t55.t2.t2))
% 0.34/0.61  (step t55.t2.t4 (cl (not (< tptp.a 1)) (<= tptp.a 0)) :rule la_generic :args (1 1))
% 0.34/0.61  (step t55.t2.t5 (cl (not (= (not (>= tptp.a 1)) (< tptp.a 1))) (not (not (>= tptp.a 1))) (< tptp.a 1)) :rule equiv_pos2)
% 0.34/0.61  (step t55.t2.t6 (cl (= (< tptp.a 1) (not (>= tptp.a 1)))) :rule all_simplify)
% 0.34/0.61  (step t55.t2.t7 (cl (= (not (>= tptp.a 1)) (< tptp.a 1))) :rule symm :premises (t55.t2.t6))
% 0.34/0.61  (step t55.t2.t8 (cl (< tptp.a 1)) :rule resolution :premises (t55.t2.t5 t55.t2.t7 t55.t2.a0))
% 0.34/0.61  (step t55.t2.t9 (cl (<= tptp.a 0)) :rule resolution :premises (t55.t2.t4 t55.t2.t8))
% 0.34/0.61  (step t55.t2.t10 (cl (not (<= 0 tptp.a))) :rule resolution :premises (t55.t2.t3 t55.t2.t9 t55.t2.a1))
% 0.34/0.61  (step t55.t2.t11 (cl (not (= (< tptp.a 0) (not (<= 0 tptp.a)))) (< tptp.a 0) (not (not (<= 0 tptp.a)))) :rule equiv_pos1)
% 0.34/0.61  (step t55.t2.t12 (cl (= (< tptp.a 0) (not (<= 0 tptp.a)))) :rule comp_simplify)
% 0.34/0.61  (step t55.t2.t13 (cl (< tptp.a 0)) :rule resolution :premises (t55.t2.t10 t55.t2.t11 t55.t2.t12))
% 0.34/0.61  (step t55.t2.t14 (cl (not (>= tptp.a 0))) :rule resolution :premises (t55.t2.t1 t15 t55.t2.t13))
% 0.34/0.61  (step t55.t2 (cl (not (not (>= tptp.a 1))) (not (not (= tptp.a 0))) (not (>= tptp.a 0))) :rule subproof :discharge (t55.t2.a0 t55.t2.a1))
% 0.34/0.61  (step t55.t3 (cl (not (and (not (>= tptp.a 1)) (not (= tptp.a 0)))) (not (>= tptp.a 1))) :rule and_pos)
% 0.34/0.61  (step t55.t4 (cl (not (and (not (>= tptp.a 1)) (not (= tptp.a 0)))) (not (= tptp.a 0))) :rule and_pos)
% 0.34/0.61  (step t55.t5 (cl (not (>= tptp.a 0)) (not (and (not (>= tptp.a 1)) (not (= tptp.a 0)))) (not (and (not (>= tptp.a 1)) (not (= tptp.a 0))))) :rule resolution :premises (t55.t2 t55.t3 t55.t4))
% 0.34/0.61  (step t55.t6 (cl (not (and (not (>= tptp.a 1)) (not (= tptp.a 0)))) (not (and (not (>= tptp.a 1)) (not (= tptp.a 0)))) (not (>= tptp.a 0))) :rule reordering :premises (t55.t5))
% 0.34/0.61  (step t55.t7 (cl (not (and (not (>= tptp.a 1)) (not (= tptp.a 0)))) (not (>= tptp.a 0))) :rule contraction :premises (t55.t6))
% 0.34/0.61  (step t55.t8 (cl (=> (and (not (>= tptp.a 1)) (not (= tptp.a 0))) (not (>= tptp.a 0))) (not (>= tptp.a 0))) :rule resolution :premises (t55.t1 t55.t7))
% 0.34/0.61  (step t55.t9 (cl (=> (and (not (>= tptp.a 1)) (not (= tptp.a 0))) (not (>= tptp.a 0))) (not (not (>= tptp.a 0)))) :rule implies_neg2)
% 0.34/0.61  (step t55.t10 (cl (=> (and (not (>= tptp.a 1)) (not (= tptp.a 0))) (not (>= tptp.a 0))) (=> (and (not (>= tptp.a 1)) (not (= tptp.a 0))) (not (>= tptp.a 0)))) :rule resolution :premises (t55.t8 t55.t9))
% 0.34/0.61  (step t55.t11 (cl (=> (and (not (>= tptp.a 1)) (not (= tptp.a 0))) (not (>= tptp.a 0)))) :rule contraction :premises (t55.t10))
% 0.34/0.61  (step t55.t12 (cl (not (and (not (>= tptp.a 1)) (not (= tptp.a 0)))) (not (>= tptp.a 0))) :rule implies :premises (t55.t11))
% 0.34/0.61  (step t55.t13 (cl (and (not (>= tptp.a 1)) (not (= tptp.a 0))) (not (not (>= tptp.a 1))) (not (not (= tptp.a 0)))) :rule and_neg)
% 0.34/0.61  (step t55.t14 (cl (and (not (>= tptp.a 1)) (not (= tptp.a 0)))) :rule resolution :premises (t55.t13 t55.a0 t55.a1))
% 0.34/0.61  (step t55.t15 (cl (not (>= tptp.a 0))) :rule resolution :premises (t55.t12 t55.t14))
% 0.34/0.61  (step t55 (cl (not (not (>= tptp.a 1))) (not (not (= tptp.a 0))) (not (>= tptp.a 0))) :rule subproof :discharge (t55.a0 t55.a1))
% 0.34/0.61  (step t56 (cl (not (and (not (>= tptp.a 1)) (not (= tptp.a 0)))) (not (>= tptp.a 1))) :rule and_pos)
% 0.34/0.61  (step t57 (cl (not (and (not (>= tptp.a 1)) (not (= tptp.a 0)))) (not (= tptp.a 0))) :rule and_pos)
% 0.34/0.61  (step t58 (cl (not (>= tptp.a 0)) (not (and (not (>= tptp.a 1)) (not (= tptp.a 0)))) (not (and (not (>= tptp.a 1)) (not (= tptp.a 0))))) :rule resolution :premises (t55 t56 t57))
% 0.34/0.61  (step t59 (cl (not (and (not (>= tptp.a 1)) (not (= tptp.a 0)))) (not (and (not (>= tptp.a 1)) (not (= tptp.a 0)))) (not (>= tptp.a 0))) :rule reordering :premises (t58))
% 0.34/0.61  (step t60 (cl (not (and (not (>= tptp.a 1)) (not (= tptp.a 0)))) (not (>= tptp.a 0))) :rule contraction :premises (t59))
% 0.34/0.61  (step t61 (cl (=> (and (not (>= tptp.a 1)) (not (= tptp.a 0))) (not (>= tptp.a 0))) (not (>= tptp.a 0))) :rule resolution :premises (t54 t60))
% 0.34/0.61  (step t62 (cl (=> (and (not (>= tptp.a 1)) (not (= tptp.a 0))) (not (>= tptp.a 0))) (not (not (>= tptp.a 0)))) :rule implies_neg2)
% 0.34/0.61  (step t63 (cl (=> (and (not (>= tptp.a 1)) (not (= tptp.a 0))) (not (>= tptp.a 0))) (=> (and (not (>= tptp.a 1)) (not (= tptp.a 0))) (not (>= tptp.a 0)))) :rule resolution :premises (t61 t62))
% 0.34/0.61  (step t64 (cl (=> (and (not (>= tptp.a 1)) (not (= tptp.a 0))) (not (>= tptp.a 0)))) :rule contraction :premises (t63))
% 0.34/0.61  (step t65 (cl (not (and (not (>= tptp.a 1)) (not (= tptp.a 0)))) (not (>= tptp.a 0))) :rule implies :premises (t64))
% 0.34/0.61  (step t66 (cl (not (not (>= tptp.a 1))) (not (not (= tptp.a 0))) (not (>= tptp.a 0))) :rule resolution :premises (t53 t65))
% 0.34/0.61  (step t67 (cl (or (not (not (>= tptp.a 1))) (not (not (= tptp.a 0))) (not (>= tptp.a 0))) (not (not (not (>= tptp.a 1))))) :rule or_neg)
% 0.34/0.61  (step t68 (cl (or (not (not (>= tptp.a 1))) (not (not (= tptp.a 0))) (not (>= tptp.a 0))) (not (not (not (= tptp.a 0))))) :rule or_neg)
% 0.34/0.61  (step t69 (cl (or (not (not (>= tptp.a 1))) (not (not (= tptp.a 0))) (not (>= tptp.a 0))) (not (not (>= tptp.a 0)))) :rule or_neg)
% 0.34/0.61  (step t70 (cl (or (not (not (>= tptp.a 1))) (not (not (= tptp.a 0))) (not (>= tptp.a 0))) (or (not (not (>= tptp.a 1))) (not (not (= tptp.a 0))) (not (>= tptp.a 0))) (or (not (not (>= tptp.a 1))) (not (not (= tptp.a 0))) (not (>= tptp.a 0)))) :rule resolution :premises (t66 t67 t68 t69))
% 0.34/0.61  (step t71 (cl (or (not (not (>= tptp.a 1))) (not (not (= tptp.a 0))) (not (>= tptp.a 0)))) :rule contraction :premises (t70))
% 0.34/0.61  (step t72 (cl (or (>= tptp.a 1) (= tptp.a 0) (not (>= tptp.a 0)))) :rule resolution :premises (t30 t52 t71))
% 0.34/0.61  (step t73 (cl (>= tptp.a 1) (= tptp.a 0) (not (>= tptp.a 0))) :rule or :premises (t72))
% 0.34/0.61  (step t74 (cl (not (= (or (not (not (>= tptp.a 2))) (not (>= tptp.a 1)) (not (not (= tptp.a 1)))) (or (>= tptp.a 2) (not (>= tptp.a 1)) (= tptp.a 1)))) (not (or (not (not (>= tptp.a 2))) (not (>= tptp.a 1)) (not (not (= tptp.a 1))))) (or (>= tptp.a 2) (not (>= tptp.a 1)) (= tptp.a 1))) :rule equiv_pos2)
% 0.34/0.61  (step t75 (cl (= (= (= (not (not (>= tptp.a 2))) (>= tptp.a 2)) true) (= (not (not (>= tptp.a 2))) (>= tptp.a 2)))) :rule equiv_simplify)
% 0.34/0.61  (step t76 (cl (not (= (= (not (not (>= tptp.a 2))) (>= tptp.a 2)) true)) (= (not (not (>= tptp.a 2))) (>= tptp.a 2))) :rule equiv1 :premises (t75))
% 0.34/0.61  (step t77 (cl (= (= (not (not (>= tptp.a 2))) (>= tptp.a 2)) (= (>= tptp.a 2) (not (not (>= tptp.a 2)))))) :rule all_simplify)
% 0.34/0.61  (step t78 (cl (= (>= tptp.a 2) (>= tptp.a 2))) :rule refl)
% 0.34/0.61  (step t79 (cl (= (not (not (>= tptp.a 2))) (>= tptp.a 2))) :rule all_simplify)
% 0.34/0.61  (step t80 (cl (= (= (>= tptp.a 2) (not (not (>= tptp.a 2)))) (= (>= tptp.a 2) (>= tptp.a 2)))) :rule cong :premises (t78 t79))
% 0.34/0.61  (step t81 (cl (= (= (>= tptp.a 2) (>= tptp.a 2)) true)) :rule all_simplify)
% 0.34/0.61  (step t82 (cl (= (= (>= tptp.a 2) (not (not (>= tptp.a 2)))) true)) :rule trans :premises (t80 t81))
% 0.34/0.61  (step t83 (cl (= (= (not (not (>= tptp.a 2))) (>= tptp.a 2)) true)) :rule trans :premises (t77 t82))
% 0.34/0.61  (step t84 (cl (= (not (not (>= tptp.a 2))) (>= tptp.a 2))) :rule resolution :premises (t76 t83))
% 0.34/0.61  (step t85 (cl (= (not (>= tptp.a 1)) (not (>= tptp.a 1)))) :rule refl)
% 0.34/0.61  (step t86 (cl (= (= (= (not (not (= tptp.a 1))) (= tptp.a 1)) true) (= (not (not (= tptp.a 1))) (= tptp.a 1)))) :rule equiv_simplify)
% 0.34/0.61  (step t87 (cl (not (= (= (not (not (= tptp.a 1))) (= tptp.a 1)) true)) (= (not (not (= tptp.a 1))) (= tptp.a 1))) :rule equiv1 :premises (t86))
% 0.34/0.61  (step t88 (cl (= (= (not (not (= tptp.a 1))) (= tptp.a 1)) (= (= tptp.a 1) (not (not (= tptp.a 1)))))) :rule all_simplify)
% 0.34/0.61  (step t89 (cl (= (= tptp.a 1) (= tptp.a 1))) :rule refl)
% 0.34/0.61  (step t90 (cl (= (not (not (= tptp.a 1))) (= tptp.a 1))) :rule all_simplify)
% 0.34/0.61  (step t91 (cl (= (= (= tptp.a 1) (not (not (= tptp.a 1)))) (= (= tptp.a 1) (= tptp.a 1)))) :rule cong :premises (t89 t90))
% 0.34/0.61  (step t92 (cl (= (= (= tptp.a 1) (= tptp.a 1)) true)) :rule all_simplify)
% 0.34/0.61  (step t93 (cl (= (= (= tptp.a 1) (not (not (= tptp.a 1)))) true)) :rule trans :premises (t91 t92))
% 0.34/0.61  (step t94 (cl (= (= (not (not (= tptp.a 1))) (= tptp.a 1)) true)) :rule trans :premises (t88 t93))
% 0.34/0.61  (step t95 (cl (= (not (not (= tptp.a 1))) (= tptp.a 1))) :rule resolution :premises (t87 t94))
% 0.34/0.61  (step t96 (cl (= (or (not (not (>= tptp.a 2))) (not (>= tptp.a 1)) (not (not (= tptp.a 1)))) (or (>= tptp.a 2) (not (>= tptp.a 1)) (= tptp.a 1)))) :rule cong :premises (t84 t85 t95))
% 0.34/0.61  (step t97 (cl (not (= (=> (and (not (>= tptp.a 2)) (>= tptp.a 1) (not (= tptp.a 1))) (and (not (= tptp.a 1)) (not (>= tptp.a 2)) (>= tptp.a 1))) (not (and (not (>= tptp.a 2)) (>= tptp.a 1) (not (= tptp.a 1)))))) (not (=> (and (not (>= tptp.a 2)) (>= tptp.a 1) (not (= tptp.a 1))) (and (not (= tptp.a 1)) (not (>= tptp.a 2)) (>= tptp.a 1)))) (not (and (not (>= tptp.a 2)) (>= tptp.a 1) (not (= tptp.a 1))))) :rule equiv_pos2)
% 0.34/0.61  (step t98 (cl (= (and (not (>= tptp.a 2)) (>= tptp.a 1) (not (= tptp.a 1))) (and (not (>= tptp.a 2)) (>= tptp.a 1) (not (= tptp.a 1))))) :rule refl)
% 0.34/0.61  (step t99 (cl (= (= (and (not (= tptp.a 1)) (not (>= tptp.a 2)) (>= tptp.a 1)) false) (not (and (not (= tptp.a 1)) (not (>= tptp.a 2)) (>= tptp.a 1))))) :rule equiv_simplify)
% 0.34/0.61  (step t100 (cl (= (and (not (= tptp.a 1)) (not (>= tptp.a 2)) (>= tptp.a 1)) false) (not (not (and (not (= tptp.a 1)) (not (>= tptp.a 2)) (>= tptp.a 1))))) :rule equiv2 :premises (t99))
% 0.34/0.61  (step t101 (cl (not (not (not (and (not (= tptp.a 1)) (not (>= tptp.a 2)) (>= tptp.a 1))))) (and (not (= tptp.a 1)) (not (>= tptp.a 2)) (>= tptp.a 1))) :rule not_not)
% 0.34/0.61  (step t102 (cl (= (and (not (= tptp.a 1)) (not (>= tptp.a 2)) (>= tptp.a 1)) false) (and (not (= tptp.a 1)) (not (>= tptp.a 2)) (>= tptp.a 1))) :rule resolution :premises (t100 t101))
% 0.34/0.61  (step t103 (cl (=> (and (not (= tptp.a 1)) (not (>= tptp.a 2)) (>= tptp.a 1)) false) (and (not (= tptp.a 1)) (not (>= tptp.a 2)) (>= tptp.a 1))) :rule implies_neg1)
% 0.34/0.61  (anchor :step t104)
% 0.34/0.61  (assume t104.a0 (not (= tptp.a 1)))
% 0.34/0.61  (assume t104.a1 (not (>= tptp.a 2)))
% 0.34/0.61  (assume t104.a2 (>= tptp.a 1))
% 0.34/0.61  (step t104.t1 (cl (or (= tptp.a 1) (not (<= tptp.a 1)) (not (<= 1 tptp.a)))) :rule la_disequality)
% 0.34/0.61  (step t104.t2 (cl (= tptp.a 1) (not (<= tptp.a 1)) (not (<= 1 tptp.a))) :rule or :premises (t104.t1))
% 0.34/0.61  (step t104.t3 (cl (not (= (>= tptp.a 1) (<= 1 tptp.a))) (not (>= tptp.a 1)) (<= 1 tptp.a)) :rule equiv_pos2)
% 0.34/0.61  (step t104.t4 (cl (= (>= tptp.a 1) (<= 1 tptp.a))) :rule comp_simplify)
% 0.34/0.61  (step t104.t5 (cl (<= 1 tptp.a)) :rule resolution :premises (t104.t3 t104.t4 t104.a2))
% 0.34/0.61  (step t104.t6 (cl (not (< tptp.a 2)) (<= tptp.a 1)) :rule la_generic :args (1 1))
% 0.34/0.61  (step t104.t7 (cl (not (= (not (>= tptp.a 2)) (< tptp.a 2))) (not (not (>= tptp.a 2))) (< tptp.a 2)) :rule equiv_pos2)
% 0.34/0.61  (step t104.t8 (cl (= (< tptp.a 2) (not (>= tptp.a 2)))) :rule all_simplify)
% 0.34/0.61  (step t104.t9 (cl (= (not (>= tptp.a 2)) (< tptp.a 2))) :rule symm :premises (t104.t8))
% 0.34/0.61  (step t104.t10 (cl (< tptp.a 2)) :rule resolution :premises (t104.t7 t104.t9 t104.a1))
% 0.34/0.61  (step t104.t11 (cl (<= tptp.a 1)) :rule resolution :premises (t104.t6 t104.t10))
% 0.34/0.61  (step t104.t12 (cl (= tptp.a 1)) :rule resolution :premises (t104.t2 t104.t5 t104.t11))
% 0.34/0.61  (step t104.t13 (cl) :rule resolution :premises (t104.t12 t104.a0))
% 0.34/0.61  (step t104 (cl (not (not (= tptp.a 1))) (not (not (>= tptp.a 2))) (not (>= tptp.a 1)) false) :rule subproof :discharge (t104.a0 t104.a1 t104.a2))
% 0.34/0.61  (step t105 (cl (not (and (not (= tptp.a 1)) (not (>= tptp.a 2)) (>= tptp.a 1))) (not (= tptp.a 1))) :rule and_pos)
% 0.34/0.61  (step t106 (cl (not (and (not (= tptp.a 1)) (not (>= tptp.a 2)) (>= tptp.a 1))) (not (>= tptp.a 2))) :rule and_pos)
% 0.34/0.61  (step t107 (cl (not (and (not (= tptp.a 1)) (not (>= tptp.a 2)) (>= tptp.a 1))) (>= tptp.a 1)) :rule and_pos)
% 0.34/0.61  (step t108 (cl false (not (and (not (= tptp.a 1)) (not (>= tptp.a 2)) (>= tptp.a 1))) (not (and (not (= tptp.a 1)) (not (>= tptp.a 2)) (>= tptp.a 1))) (not (and (not (= tptp.a 1)) (not (>= tptp.a 2)) (>= tptp.a 1)))) :rule resolution :premises (t104 t105 t106 t107))
% 0.34/0.61  (step t109 (cl (not (and (not (= tptp.a 1)) (not (>= tptp.a 2)) (>= tptp.a 1))) (not (and (not (= tptp.a 1)) (not (>= tptp.a 2)) (>= tptp.a 1))) (not (and (not (= tptp.a 1)) (not (>= tptp.a 2)) (>= tptp.a 1))) false) :rule reordering :premises (t108))
% 0.34/0.61  (step t110 (cl (not (and (not (= tptp.a 1)) (not (>= tptp.a 2)) (>= tptp.a 1))) false) :rule contraction :premises (t109))
% 0.34/0.61  (step t111 (cl (=> (and (not (= tptp.a 1)) (not (>= tptp.a 2)) (>= tptp.a 1)) false) false) :rule resolution :premises (t103 t110))
% 0.34/0.61  (step t112 (cl (=> (and (not (= tptp.a 1)) (not (>= tptp.a 2)) (>= tptp.a 1)) false) (not false)) :rule implies_neg2)
% 0.34/0.61  (step t113 (cl (=> (and (not (= tptp.a 1)) (not (>= tptp.a 2)) (>= tptp.a 1)) false) (=> (and (not (= tptp.a 1)) (not (>= tptp.a 2)) (>= tptp.a 1)) false)) :rule resolution :premises (t111 t112))
% 0.34/0.61  (step t114 (cl (=> (and (not (= tptp.a 1)) (not (>= tptp.a 2)) (>= tptp.a 1)) false)) :rule contraction :premises (t113))
% 0.34/0.61  (step t115 (cl (= (=> (and (not (= tptp.a 1)) (not (>= tptp.a 2)) (>= tptp.a 1)) false) (not (and (not (= tptp.a 1)) (not (>= tptp.a 2)) (>= tptp.a 1))))) :rule implies_simplify)
% 0.34/0.61  (step t116 (cl (not (=> (and (not (= tptp.a 1)) (not (>= tptp.a 2)) (>= tptp.a 1)) false)) (not (and (not (= tptp.a 1)) (not (>= tptp.a 2)) (>= tptp.a 1)))) :rule equiv1 :premises (t115))
% 0.34/0.61  (step t117 (cl (not (and (not (= tptp.a 1)) (not (>= tptp.a 2)) (>= tptp.a 1)))) :rule resolution :premises (t114 t116))
% 0.34/0.61  (step t118 (cl (= (and (not (= tptp.a 1)) (not (>= tptp.a 2)) (>= tptp.a 1)) false)) :rule resolution :premises (t102 t117))
% 0.34/0.61  (step t119 (cl (= (=> (and (not (>= tptp.a 2)) (>= tptp.a 1) (not (= tptp.a 1))) (and (not (= tptp.a 1)) (not (>= tptp.a 2)) (>= tptp.a 1))) (=> (and (not (>= tptp.a 2)) (>= tptp.a 1) (not (= tptp.a 1))) false))) :rule cong :premises (t98 t118))
% 0.34/0.61  (step t120 (cl (= (=> (and (not (>= tptp.a 2)) (>= tptp.a 1) (not (= tptp.a 1))) false) (not (and (not (>= tptp.a 2)) (>= tptp.a 1) (not (= tptp.a 1)))))) :rule all_simplify)
% 0.34/0.61  (step t121 (cl (= (=> (and (not (>= tptp.a 2)) (>= tptp.a 1) (not (= tptp.a 1))) (and (not (= tptp.a 1)) (not (>= tptp.a 2)) (>= tptp.a 1))) (not (and (not (>= tptp.a 2)) (>= tptp.a 1) (not (= tptp.a 1)))))) :rule trans :premises (t119 t120))
% 0.34/0.61  (step t122 (cl (=> (and (not (>= tptp.a 2)) (>= tptp.a 1) (not (= tptp.a 1))) (and (not (= tptp.a 1)) (not (>= tptp.a 2)) (>= tptp.a 1))) (and (not (>= tptp.a 2)) (>= tptp.a 1) (not (= tptp.a 1)))) :rule implies_neg1)
% 0.34/0.61  (anchor :step t123)
% 0.34/0.61  (assume t123.a0 (not (>= tptp.a 2)))
% 0.34/0.61  (assume t123.a1 (>= tptp.a 1))
% 0.34/0.61  (assume t123.a2 (not (= tptp.a 1)))
% 0.34/0.61  (step t123.t1 (cl (and (not (= tptp.a 1)) (not (>= tptp.a 2)) (>= tptp.a 1)) (not (not (= tptp.a 1))) (not (not (>= tptp.a 2))) (not (>= tptp.a 1))) :rule and_neg)
% 0.34/0.61  (step t123.t2 (cl (and (not (= tptp.a 1)) (not (>= tptp.a 2)) (>= tptp.a 1))) :rule resolution :premises (t123.t1 t123.a2 t123.a0 t123.a1))
% 0.34/0.61  (step t123 (cl (not (not (>= tptp.a 2))) (not (>= tptp.a 1)) (not (not (= tptp.a 1))) (and (not (= tptp.a 1)) (not (>= tptp.a 2)) (>= tptp.a 1))) :rule subproof :discharge (t123.a0 t123.a1 t123.a2))
% 0.34/0.61  (step t124 (cl (not (and (not (>= tptp.a 2)) (>= tptp.a 1) (not (= tptp.a 1)))) (not (>= tptp.a 2))) :rule and_pos)
% 0.34/0.61  (step t125 (cl (not (and (not (>= tptp.a 2)) (>= tptp.a 1) (not (= tptp.a 1)))) (>= tptp.a 1)) :rule and_pos)
% 0.34/0.61  (step t126 (cl (not (and (not (>= tptp.a 2)) (>= tptp.a 1) (not (= tptp.a 1)))) (not (= tptp.a 1))) :rule and_pos)
% 0.34/0.61  (step t127 (cl (and (not (= tptp.a 1)) (not (>= tptp.a 2)) (>= tptp.a 1)) (not (and (not (>= tptp.a 2)) (>= tptp.a 1) (not (= tptp.a 1)))) (not (and (not (>= tptp.a 2)) (>= tptp.a 1) (not (= tptp.a 1)))) (not (and (not (>= tptp.a 2)) (>= tptp.a 1) (not (= tptp.a 1))))) :rule resolution :premises (t123 t124 t125 t126))
% 0.34/0.61  (step t128 (cl (not (and (not (>= tptp.a 2)) (>= tptp.a 1) (not (= tptp.a 1)))) (not (and (not (>= tptp.a 2)) (>= tptp.a 1) (not (= tptp.a 1)))) (not (and (not (>= tptp.a 2)) (>= tptp.a 1) (not (= tptp.a 1)))) (and (not (= tptp.a 1)) (not (>= tptp.a 2)) (>= tptp.a 1))) :rule reordering :premises (t127))
% 0.34/0.61  (step t129 (cl (not (and (not (>= tptp.a 2)) (>= tptp.a 1) (not (= tptp.a 1)))) (and (not (= tptp.a 1)) (not (>= tptp.a 2)) (>= tptp.a 1))) :rule contraction :premises (t128))
% 0.34/0.61  (step t130 (cl (=> (and (not (>= tptp.a 2)) (>= tptp.a 1) (not (= tptp.a 1))) (and (not (= tptp.a 1)) (not (>= tptp.a 2)) (>= tptp.a 1))) (and (not (= tptp.a 1)) (not (>= tptp.a 2)) (>= tptp.a 1))) :rule resolution :premises (t122 t129))
% 0.34/0.61  (step t131 (cl (=> (and (not (>= tptp.a 2)) (>= tptp.a 1) (not (= tptp.a 1))) (and (not (= tptp.a 1)) (not (>= tptp.a 2)) (>= tptp.a 1))) (not (and (not (= tptp.a 1)) (not (>= tptp.a 2)) (>= tptp.a 1)))) :rule implies_neg2)
% 0.34/0.61  (step t132 (cl (=> (and (not (>= tptp.a 2)) (>= tptp.a 1) (not (= tptp.a 1))) (and (not (= tptp.a 1)) (not (>= tptp.a 2)) (>= tptp.a 1))) (=> (and (not (>= tptp.a 2)) (>= tptp.a 1) (not (= tptp.a 1))) (and (not (= tptp.a 1)) (not (>= tptp.a 2)) (>= tptp.a 1)))) :rule resolution :premises (t130 t131))
% 0.34/0.61  (step t133 (cl (=> (and (not (>= tptp.a 2)) (>= tptp.a 1) (not (= tptp.a 1))) (and (not (= tptp.a 1)) (not (>= tptp.a 2)) (>= tptp.a 1)))) :rule contraction :premises (t132))
% 0.34/0.61  (step t134 (cl (not (and (not (>= tptp.a 2)) (>= tptp.a 1) (not (= tptp.a 1))))) :rule resolution :premises (t97 t121 t133))
% 0.34/0.61  (step t135 (cl (not (not (>= tptp.a 2))) (not (>= tptp.a 1)) (not (not (= tptp.a 1)))) :rule not_and :premises (t134))
% 0.34/0.61  (step t136 (cl (or (not (not (>= tptp.a 2))) (not (>= tptp.a 1)) (not (not (= tptp.a 1)))) (not (not (not (>= tptp.a 2))))) :rule or_neg)
% 0.34/0.61  (step t137 (cl (or (not (not (>= tptp.a 2))) (not (>= tptp.a 1)) (not (not (= tptp.a 1)))) (not (not (>= tptp.a 1)))) :rule or_neg)
% 0.34/0.61  (step t138 (cl (or (not (not (>= tptp.a 2))) (not (>= tptp.a 1)) (not (not (= tptp.a 1)))) (not (not (not (= tptp.a 1))))) :rule or_neg)
% 0.34/0.61  (step t139 (cl (or (not (not (>= tptp.a 2))) (not (>= tptp.a 1)) (not (not (= tptp.a 1)))) (or (not (not (>= tptp.a 2))) (not (>= tptp.a 1)) (not (not (= tptp.a 1)))) (or (not (not (>= tptp.a 2))) (not (>= tptp.a 1)) (not (not (= tptp.a 1))))) :rule resolution :premises (t135 t136 t137 t138))
% 0.34/0.61  (step t140 (cl (or (not (not (>= tptp.a 2))) (not (>= tptp.a 1)) (not (not (= tptp.a 1))))) :rule contraction :premises (t139))
% 0.34/0.61  (step t141 (cl (or (>= tptp.a 2) (not (>= tptp.a 1)) (= tptp.a 1))) :rule resolution :premises (t74 t96 t140))
% 0.34/0.61  (step t142 (cl (>= tptp.a 2) (not (>= tptp.a 1)) (= tptp.a 1)) :rule or :premises (t141))
% 0.34/0.61  (step t143 (cl (not (= (not (= (>= 3 (* (* tptp.a tptp.a) tptp.a)) (<= tptp.a 1))) (not (= (not (>= (* tptp.a tptp.a tptp.a) 4)) (not (>= tptp.a 2)))))) (not (not (= (>= 3 (* (* tptp.a tptp.a) tptp.a)) (<= tptp.a 1)))) (not (= (not (>= (* tptp.a tptp.a tptp.a) 4)) (not (>= tptp.a 2))))) :rule equiv_pos2)
% 0.34/0.61  (step t144 (cl (= 3 3)) :rule refl)
% 0.34/0.61  (step t145 (cl (= (* tptp.a tptp.a) (* tptp.a tptp.a))) :rule all_simplify)
% 0.34/0.61  (step t146 (cl (= tptp.a tptp.a)) :rule refl)
% 0.34/0.61  (step t147 (cl (= (* (* tptp.a tptp.a) tptp.a) (* (* tptp.a tptp.a) tptp.a))) :rule cong :premises (t145 t146))
% 0.34/0.61  (step t148 (cl (= (* (* tptp.a tptp.a) tptp.a) (* tptp.a tptp.a tptp.a))) :rule all_simplify)
% 0.34/0.61  (step t149 (cl (= (* (* tptp.a tptp.a) tptp.a) (* tptp.a tptp.a tptp.a))) :rule trans :premises (t147 t148))
% 0.34/0.61  (step t150 (cl (= (>= 3 (* (* tptp.a tptp.a) tptp.a)) (>= 3 (* tptp.a tptp.a tptp.a)))) :rule cong :premises (t144 t149))
% 0.34/0.61  (step t151 (cl (= (>= 3 (* tptp.a tptp.a tptp.a)) (not (>= (* tptp.a tptp.a tptp.a) 4)))) :rule all_simplify)
% 0.34/0.61  (step t152 (cl (= (>= 3 (* (* tptp.a tptp.a) tptp.a)) (not (>= (* tptp.a tptp.a tptp.a) 4)))) :rule trans :premises (t150 t151))
% 0.34/0.61  (step t153 (cl (= (<= tptp.a 1) (not (>= tptp.a 2)))) :rule all_simplify)
% 0.34/0.61  (step t154 (cl (= (= (>= 3 (* (* tptp.a tptp.a) tptp.a)) (<= tptp.a 1)) (= (not (>= (* tptp.a tptp.a tptp.a) 4)) (not (>= tptp.a 2))))) :rule cong :premises (t152 t153))
% 0.34/0.61  (step t155 (cl (= (not (= (>= 3 (* (* tptp.a tptp.a) tptp.a)) (<= tptp.a 1))) (not (= (not (>= (* tptp.a tptp.a tptp.a) 4)) (not (>= tptp.a 2)))))) :rule cong :premises (t154))
% 0.34/0.61  (step t156 (cl (not (= (not (>= (* tptp.a tptp.a tptp.a) 4)) (not (>= tptp.a 2))))) :rule resolution :premises (t143 t155 a0))
% 0.34/0.61  (step t157 (cl (not (>= (* tptp.a tptp.a tptp.a) 4)) (not (>= tptp.a 2))) :rule not_equiv1 :premises (t156))
% 0.34/0.61  (step t158 (cl (not (= (or (not (not (>= (* tptp.a tptp.a tptp.a) 4))) (not (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1))) (not (>= (* tptp.a tptp.a) 2))) (or (>= (* tptp.a tptp.a tptp.a) 4) (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1) (not (>= (* tptp.a tptp.a) 2))))) (not (or (not (not (>= (* tptp.a tptp.a tptp.a) 4))) (not (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1))) (not (>= (* tptp.a tptp.a) 2)))) (or (>= (* tptp.a tptp.a tptp.a) 4) (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1) (not (>= (* tptp.a tptp.a) 2)))) :rule equiv_pos2)
% 0.34/0.61  (step t159 (cl (= (= (= (not (not (>= (* tptp.a tptp.a tptp.a) 4))) (>= (* tptp.a tptp.a tptp.a) 4)) true) (= (not (not (>= (* tptp.a tptp.a tptp.a) 4))) (>= (* tptp.a tptp.a tptp.a) 4)))) :rule equiv_simplify)
% 0.34/0.61  (step t160 (cl (not (= (= (not (not (>= (* tptp.a tptp.a tptp.a) 4))) (>= (* tptp.a tptp.a tptp.a) 4)) true)) (= (not (not (>= (* tptp.a tptp.a tptp.a) 4))) (>= (* tptp.a tptp.a tptp.a) 4))) :rule equiv1 :premises (t159))
% 0.34/0.61  (step t161 (cl (= (= (not (not (>= (* tptp.a tptp.a tptp.a) 4))) (>= (* tptp.a tptp.a tptp.a) 4)) (= (>= (* tptp.a tptp.a tptp.a) 4) (not (not (>= (* tptp.a tptp.a tptp.a) 4)))))) :rule all_simplify)
% 0.34/0.61  (step t162 (cl (= (>= (* tptp.a tptp.a tptp.a) 4) (>= (* tptp.a tptp.a tptp.a) 4))) :rule refl)
% 0.34/0.61  (step t163 (cl (= (not (not (>= (* tptp.a tptp.a tptp.a) 4))) (>= (* tptp.a tptp.a tptp.a) 4))) :rule all_simplify)
% 0.34/0.61  (step t164 (cl (= (= (>= (* tptp.a tptp.a tptp.a) 4) (not (not (>= (* tptp.a tptp.a tptp.a) 4)))) (= (>= (* tptp.a tptp.a tptp.a) 4) (>= (* tptp.a tptp.a tptp.a) 4)))) :rule cong :premises (t162 t163))
% 0.34/0.61  (step t165 (cl (= (= (>= (* tptp.a tptp.a tptp.a) 4) (>= (* tptp.a tptp.a tptp.a) 4)) true)) :rule all_simplify)
% 0.34/0.61  (step t166 (cl (= (= (>= (* tptp.a tptp.a tptp.a) 4) (not (not (>= (* tptp.a tptp.a tptp.a) 4)))) true)) :rule trans :premises (t164 t165))
% 0.34/0.61  (step t167 (cl (= (= (not (not (>= (* tptp.a tptp.a tptp.a) 4))) (>= (* tptp.a tptp.a tptp.a) 4)) true)) :rule trans :premises (t161 t166))
% 0.34/0.61  (step t168 (cl (= (not (not (>= (* tptp.a tptp.a tptp.a) 4))) (>= (* tptp.a tptp.a tptp.a) 4))) :rule resolution :premises (t160 t167))
% 0.34/0.61  (step t169 (cl (= (= (= (not (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1))) (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) true) (= (not (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1))) (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)))) :rule equiv_simplify)
% 0.34/0.61  (step t170 (cl (not (= (= (not (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1))) (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) true)) (= (not (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1))) (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1))) :rule equiv1 :premises (t169))
% 0.34/0.61  (step t171 (cl (= (= (not (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1))) (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (= (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1) (not (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)))))) :rule all_simplify)
% 0.34/0.61  (step t172 (cl (= (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1) (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1))) :rule refl)
% 0.34/0.61  (step t173 (cl (= (not (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1))) (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1))) :rule all_simplify)
% 0.34/0.61  (step t174 (cl (= (= (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1) (not (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)))) (= (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1) (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)))) :rule cong :premises (t172 t173))
% 0.34/0.61  (step t175 (cl (= (= (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1) (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) true)) :rule all_simplify)
% 0.34/0.61  (step t176 (cl (= (= (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1) (not (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)))) true)) :rule trans :premises (t174 t175))
% 0.34/0.61  (step t177 (cl (= (= (not (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1))) (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) true)) :rule trans :premises (t171 t176))
% 0.34/0.61  (step t178 (cl (= (not (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1))) (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1))) :rule resolution :premises (t170 t177))
% 0.34/0.61  (step t179 (cl (= (not (>= (* tptp.a tptp.a) 2)) (not (>= (* tptp.a tptp.a) 2)))) :rule refl)
% 0.34/0.61  (step t180 (cl (= (or (not (not (>= (* tptp.a tptp.a tptp.a) 4))) (not (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1))) (not (>= (* tptp.a tptp.a) 2))) (or (>= (* tptp.a tptp.a tptp.a) 4) (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1) (not (>= (* tptp.a tptp.a) 2))))) :rule cong :premises (t168 t178 t179))
% 0.34/0.61  (step t181 (cl (not (= (=> (and (not (>= (* tptp.a tptp.a tptp.a) 4)) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (>= (* tptp.a tptp.a) 2)) (and (>= (* tptp.a tptp.a) 2) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (not (>= (* tptp.a tptp.a tptp.a) 4)))) (not (and (not (>= (* tptp.a tptp.a tptp.a) 4)) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (>= (* tptp.a tptp.a) 2))))) (not (=> (and (not (>= (* tptp.a tptp.a tptp.a) 4)) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (>= (* tptp.a tptp.a) 2)) (and (>= (* tptp.a tptp.a) 2) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (not (>= (* tptp.a tptp.a tptp.a) 4))))) (not (and (not (>= (* tptp.a tptp.a tptp.a) 4)) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (>= (* tptp.a tptp.a) 2)))) :rule equiv_pos2)
% 0.34/0.61  (step t182 (cl (= (and (not (>= (* tptp.a tptp.a tptp.a) 4)) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (>= (* tptp.a tptp.a) 2)) (and (not (>= (* tptp.a tptp.a tptp.a) 4)) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (>= (* tptp.a tptp.a) 2)))) :rule refl)
% 0.34/0.61  (step t183 (cl (= (= (and (>= (* tptp.a tptp.a) 2) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (not (>= (* tptp.a tptp.a tptp.a) 4))) false) (not (and (>= (* tptp.a tptp.a) 2) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (not (>= (* tptp.a tptp.a tptp.a) 4)))))) :rule equiv_simplify)
% 0.34/0.61  (step t184 (cl (= (and (>= (* tptp.a tptp.a) 2) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (not (>= (* tptp.a tptp.a tptp.a) 4))) false) (not (not (and (>= (* tptp.a tptp.a) 2) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (not (>= (* tptp.a tptp.a tptp.a) 4)))))) :rule equiv2 :premises (t183))
% 0.34/0.61  (step t185 (cl (not (not (not (and (>= (* tptp.a tptp.a) 2) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (not (>= (* tptp.a tptp.a tptp.a) 4)))))) (and (>= (* tptp.a tptp.a) 2) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (not (>= (* tptp.a tptp.a tptp.a) 4)))) :rule not_not)
% 0.34/0.61  (step t186 (cl (= (and (>= (* tptp.a tptp.a) 2) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (not (>= (* tptp.a tptp.a tptp.a) 4))) false) (and (>= (* tptp.a tptp.a) 2) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (not (>= (* tptp.a tptp.a tptp.a) 4)))) :rule resolution :premises (t184 t185))
% 0.34/0.61  (step t187 (cl (=> (and (>= (* tptp.a tptp.a) 2) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (not (>= (* tptp.a tptp.a tptp.a) 4))) false) (and (>= (* tptp.a tptp.a) 2) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (not (>= (* tptp.a tptp.a tptp.a) 4)))) :rule implies_neg1)
% 0.34/0.61  (anchor :step t188)
% 0.34/0.61  (assume t188.a0 (>= (* tptp.a tptp.a) 2))
% 0.34/0.61  (assume t188.a1 (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)))
% 0.34/0.61  (assume t188.a2 (not (>= (* tptp.a tptp.a tptp.a) 4)))
% 0.34/0.61  (step t188.t1 (cl (not (< (* tptp.a tptp.a tptp.a) 4)) (<= (* tptp.a tptp.a tptp.a) 3)) :rule la_generic :args (1 1))
% 0.34/0.61  (step t188.t2 (cl (not (= (not (>= (* tptp.a tptp.a tptp.a) 4)) (< (* tptp.a tptp.a tptp.a) 4))) (not (not (>= (* tptp.a tptp.a tptp.a) 4))) (< (* tptp.a tptp.a tptp.a) 4)) :rule equiv_pos2)
% 0.34/0.61  (step t188.t3 (cl (= (< (* tptp.a tptp.a tptp.a) 4) (not (>= (* tptp.a tptp.a tptp.a) 4)))) :rule all_simplify)
% 0.34/0.61  (step t188.t4 (cl (= (not (>= (* tptp.a tptp.a tptp.a) 4)) (< (* tptp.a tptp.a tptp.a) 4))) :rule symm :premises (t188.t3))
% 0.34/0.61  (step t188.t5 (cl (< (* tptp.a tptp.a tptp.a) 4)) :rule resolution :premises (t188.t2 t188.t4 t188.a2))
% 0.34/0.61  (step t188.t6 (cl (<= (* tptp.a tptp.a tptp.a) 3)) :rule resolution :premises (t188.t1 t188.t5))
% 0.34/0.61  (step t188.t7 (cl (not (= (> (* tptp.a tptp.a tptp.a) 3) (not (<= (* tptp.a tptp.a tptp.a) 3)))) (not (> (* tptp.a tptp.a tptp.a) 3)) (not (<= (* tptp.a tptp.a tptp.a) 3))) :rule equiv_pos2)
% 0.34/0.61  (step t188.t8 (cl (= (> (* tptp.a tptp.a tptp.a) 3) (not (<= (* tptp.a tptp.a tptp.a) 3)))) :rule all_simplify)
% 0.34/0.61  (step t188.t9 (cl (= (<= (* tptp.a tptp.a tptp.a) 3) (not (>= (* tptp.a tptp.a tptp.a) 4)))) :rule all_simplify)
% 0.34/0.61  (step t188.t10 (cl (= (not (<= (* tptp.a tptp.a tptp.a) 3)) (not (not (>= (* tptp.a tptp.a tptp.a) 4))))) :rule cong :premises (t188.t9))
% 0.34/0.61  (step t188.t11 (cl (= (not (<= (* tptp.a tptp.a tptp.a) 3)) (>= (* tptp.a tptp.a tptp.a) 4))) :rule trans :premises (t188.t10 t163))
% 0.34/0.61  (step t188.t12 (cl (= (> (* tptp.a tptp.a tptp.a) 3) (>= (* tptp.a tptp.a tptp.a) 4))) :rule trans :premises (t188.t8 t188.t11))
% 0.34/0.61  (step t188.t13 (cl (= (>= (* tptp.a tptp.a tptp.a) 4) (not (<= (* tptp.a tptp.a tptp.a) 3)))) :rule symm :premises (t188.t11))
% 0.34/0.61  (step t188.t14 (cl (= (> (* tptp.a tptp.a tptp.a) 3) (not (<= (* tptp.a tptp.a tptp.a) 3)))) :rule trans :premises (t188.t12 t188.t13))
% 0.34/0.61  (step t188.t15 (cl (not (= (not (<= (* tptp.a tptp.a tptp.a) 3)) (> (* tptp.a tptp.a tptp.a) 3))) (not (not (<= (* tptp.a tptp.a tptp.a) 3))) (> (* tptp.a tptp.a tptp.a) 3)) :rule equiv_pos2)
% 0.34/0.61  (step t188.t16 (cl (= (>= (* tptp.a tptp.a tptp.a) 4) (> (* tptp.a tptp.a tptp.a) 3))) :rule symm :premises (t188.t12))
% 0.34/0.61  (step t188.t17 (cl (= (not (<= (* tptp.a tptp.a tptp.a) 3)) (> (* tptp.a tptp.a tptp.a) 3))) :rule trans :premises (t188.t11 t188.t16))
% 0.34/0.61  (step t188.t18 (cl (=> (<= (* tptp.a tptp.a tptp.a) 3) false) (<= (* tptp.a tptp.a tptp.a) 3)) :rule implies_neg1)
% 0.34/0.61  (anchor :step t188.t19)
% 0.34/0.61  (assume t188.t19.a0 (<= (* tptp.a tptp.a tptp.a) 3))
% 0.34/0.61  (step t188.t19.t1 (cl (not (= (< (+ (* 1.0 (* tptp.a tptp.a tptp.a)) (* 1.0 (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a)))) (* (- 2.0) (* tptp.a tptp.a))) (+ (* 1.0 3) (* 1.0 1) (* (- 2.0) 2))) false)) (not (< (+ (* 1.0 (* tptp.a tptp.a tptp.a)) (* 1.0 (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a)))) (* (- 2.0) (* tptp.a tptp.a))) (+ (* 1.0 3) (* 1.0 1) (* (- 2.0) 2)))) false) :rule equiv_pos2)
% 0.34/0.61  (step t188.t19.t2 (cl (= (< (+ (* 1.0 (* tptp.a tptp.a tptp.a)) (* 1.0 (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a)))) (* (- 2.0) (* tptp.a tptp.a))) (+ (* 1.0 3) (* 1.0 1) (* (- 2.0) 2))) (not (>= (+ (* 1.0 (* tptp.a tptp.a tptp.a)) (* 1.0 (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a)))) (* (- 2.0) (* tptp.a tptp.a))) (+ (* 1.0 3) (* 1.0 1) (* (- 2.0) 2)))))) :rule all_simplify)
% 0.34/0.61  (step t188.t19.t3 (cl (= (* 1.0 (* tptp.a tptp.a tptp.a)) (to_real (* tptp.a tptp.a tptp.a)))) :rule all_simplify)
% 0.34/0.61  (step t188.t19.t4 (cl (= (* 1.0 (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a)))) (to_real (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a)))))) :rule all_simplify)
% 0.34/0.61  (step t188.t19.t5 (cl (= (* (- 2.0) (* tptp.a tptp.a)) (to_real (* (- 2) (* tptp.a tptp.a))))) :rule all_simplify)
% 0.34/0.61  (step t188.t19.t6 (cl (= (+ (* 1.0 (* tptp.a tptp.a tptp.a)) (* 1.0 (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a)))) (* (- 2.0) (* tptp.a tptp.a))) (+ (to_real (* tptp.a tptp.a tptp.a)) (to_real (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a)))) (to_real (* (- 2) (* tptp.a tptp.a)))))) :rule cong :premises (t188.t19.t3 t188.t19.t4 t188.t19.t5))
% 0.34/0.61  (step t188.t19.t7 (cl (= (+ (to_real (* tptp.a tptp.a tptp.a)) (to_real (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a)))) (to_real (* (- 2) (* tptp.a tptp.a)))) 0.0)) :rule all_simplify)
% 0.34/0.61  (step t188.t19.t8 (cl (= (+ (* 1.0 (* tptp.a tptp.a tptp.a)) (* 1.0 (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a)))) (* (- 2.0) (* tptp.a tptp.a))) 0.0)) :rule trans :premises (t188.t19.t6 t188.t19.t7))
% 0.34/0.61  (step t188.t19.t9 (cl (= (* 1.0 3) 3.0)) :rule all_simplify)
% 0.34/0.61  (step t188.t19.t10 (cl (= (* 1.0 1) 1.0)) :rule all_simplify)
% 0.34/0.61  (step t188.t19.t11 (cl (= (* (- 2.0) 2) (- 4.0))) :rule all_simplify)
% 0.34/0.61  (step t188.t19.t12 (cl (= (+ (* 1.0 3) (* 1.0 1) (* (- 2.0) 2)) (+ 3.0 1.0 (- 4.0)))) :rule cong :premises (t188.t19.t9 t188.t19.t10 t188.t19.t11))
% 0.34/0.61  (step t188.t19.t13 (cl (= (+ 3.0 1.0 (- 4.0)) 0.0)) :rule all_simplify)
% 0.34/0.61  (step t188.t19.t14 (cl (= (+ (* 1.0 3) (* 1.0 1) (* (- 2.0) 2)) 0.0)) :rule trans :premises (t188.t19.t12 t188.t19.t13))
% 0.34/0.61  (step t188.t19.t15 (cl (= (>= (+ (* 1.0 (* tptp.a tptp.a tptp.a)) (* 1.0 (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a)))) (* (- 2.0) (* tptp.a tptp.a))) (+ (* 1.0 3) (* 1.0 1) (* (- 2.0) 2))) (>= 0.0 0.0))) :rule cong :premises (t188.t19.t8 t188.t19.t14))
% 0.34/0.61  (step t188.t19.t16 (cl (= (>= 0.0 0.0) true)) :rule all_simplify)
% 0.34/0.61  (step t188.t19.t17 (cl (= (>= (+ (* 1.0 (* tptp.a tptp.a tptp.a)) (* 1.0 (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a)))) (* (- 2.0) (* tptp.a tptp.a))) (+ (* 1.0 3) (* 1.0 1) (* (- 2.0) 2))) true)) :rule trans :premises (t188.t19.t15 t188.t19.t16))
% 0.34/0.61  (step t188.t19.t18 (cl (= (not (>= (+ (* 1.0 (* tptp.a tptp.a tptp.a)) (* 1.0 (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a)))) (* (- 2.0) (* tptp.a tptp.a))) (+ (* 1.0 3) (* 1.0 1) (* (- 2.0) 2)))) (not true))) :rule cong :premises (t188.t19.t17))
% 0.34/0.61  (step t188.t19.t19 (cl (= (not true) false)) :rule all_simplify)
% 0.34/0.61  (step t188.t19.t20 (cl (= (not (>= (+ (* 1.0 (* tptp.a tptp.a tptp.a)) (* 1.0 (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a)))) (* (- 2.0) (* tptp.a tptp.a))) (+ (* 1.0 3) (* 1.0 1) (* (- 2.0) 2)))) false)) :rule trans :premises (t188.t19.t18 t188.t19.t19))
% 0.34/0.61  (step t188.t19.t21 (cl (= (< (+ (* 1.0 (* tptp.a tptp.a tptp.a)) (* 1.0 (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a)))) (* (- 2.0) (* tptp.a tptp.a))) (+ (* 1.0 3) (* 1.0 1) (* (- 2.0) 2))) false)) :rule trans :premises (t188.t19.t2 t188.t19.t20))
% 0.34/0.61  (step t188.t19.t22 (cl (not (<= (* 1.0 (* tptp.a tptp.a tptp.a)) (* 1.0 3))) (not (< (* 1.0 (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a)))) (* 1.0 1))) (not (<= (* (- 2.0) (* tptp.a tptp.a)) (* (- 2.0) 2))) (< (+ (* 1.0 (* tptp.a tptp.a tptp.a)) (* 1.0 (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a)))) (* (- 2.0) (* tptp.a tptp.a))) (+ (* 1.0 3) (* 1.0 1) (* (- 2.0) 2)))) :rule la_generic :args (1 1 1 1))
% 0.34/0.61  (step t188.t19.t23 (cl (=> (and (> 1.0 0) (<= (* tptp.a tptp.a tptp.a) 3)) (<= (* 1.0 (* tptp.a tptp.a tptp.a)) (* 1.0 3)))) :rule la_mult_pos)
% 0.34/0.61  (step t188.t19.t24 (cl (not (and (> 1.0 0) (<= (* tptp.a tptp.a tptp.a) 3))) (<= (* 1.0 (* tptp.a tptp.a tptp.a)) (* 1.0 3))) :rule implies :premises (t188.t19.t23))
% 0.34/0.61  (step t188.t19.t25 (cl (and (> 1.0 0) (<= (* tptp.a tptp.a tptp.a) 3)) (not (> 1.0 0)) (not (<= (* tptp.a tptp.a tptp.a) 3))) :rule and_neg)
% 0.34/0.61  (step t188.t19.t26 (cl (= (= (> 1.0 0) true) (> 1.0 0))) :rule equiv_simplify)
% 0.34/0.61  (step t188.t19.t27 (cl (not (= (> 1.0 0) true)) (> 1.0 0)) :rule equiv1 :premises (t188.t19.t26))
% 0.34/0.61  (step t188.t19.t28 (cl (= (> 1.0 0) true)) :rule hole :args ((> 1.0 0)))
% 0.34/0.61  (step t188.t19.t29 (cl (> 1.0 0)) :rule resolution :premises (t188.t19.t27 t188.t19.t28))
% 0.34/0.61  (step t188.t19.t30 (cl (and (> 1.0 0) (<= (* tptp.a tptp.a tptp.a) 3))) :rule resolution :premises (t188.t19.t25 t188.t19.t29 t188.t19.a0))
% 0.34/0.61  (step t188.t19.t31 (cl (<= (* 1.0 (* tptp.a tptp.a tptp.a)) (* 1.0 3))) :rule resolution :premises (t188.t19.t24 t188.t19.t30))
% 0.34/0.61  (step t188.t19.t32 (cl (=> (and (> 1.0 0) (< (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (< (* 1.0 (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a)))) (* 1.0 1)))) :rule la_mult_pos)
% 0.34/0.61  (step t188.t19.t33 (cl (not (and (> 1.0 0) (< (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1))) (< (* 1.0 (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a)))) (* 1.0 1))) :rule implies :premises (t188.t19.t32))
% 0.34/0.61  (step t188.t19.t34 (cl (and (> 1.0 0) (< (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (not (> 1.0 0)) (not (< (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1))) :rule and_neg)
% 0.34/0.61  (step t188.t19.t35 (cl (not (= (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (< (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1))) (not (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1))) (< (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) :rule equiv_pos2)
% 0.34/0.61  (step t188.t19.t36 (cl (= (< (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)))) :rule all_simplify)
% 0.34/0.61  (step t188.t19.t37 (cl (= (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (< (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1))) :rule symm :premises (t188.t19.t36))
% 0.34/0.61  (step t188.t19.t38 (cl (< (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) :rule resolution :premises (t188.t19.t35 t188.t19.t37 t188.a1))
% 0.34/0.61  (step t188.t19.t39 (cl (and (> 1.0 0) (< (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1))) :rule resolution :premises (t188.t19.t34 t188.t19.t29 t188.t19.t38))
% 0.34/0.61  (step t188.t19.t40 (cl (< (* 1.0 (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a)))) (* 1.0 1))) :rule resolution :premises (t188.t19.t33 t188.t19.t39))
% 0.34/0.61  (step t188.t19.t41 (cl (=> (and (< (- 2.0) 0) (>= (* tptp.a tptp.a) 2)) (<= (* (- 2.0) (* tptp.a tptp.a)) (* (- 2.0) 2)))) :rule la_mult_neg)
% 0.34/0.61  (step t188.t19.t42 (cl (not (and (< (- 2.0) 0) (>= (* tptp.a tptp.a) 2))) (<= (* (- 2.0) (* tptp.a tptp.a)) (* (- 2.0) 2))) :rule implies :premises (t188.t19.t41))
% 0.34/0.61  (step t188.t19.t43 (cl (and (< (- 2.0) 0) (>= (* tptp.a tptp.a) 2)) (not (< (- 2.0) 0)) (not (>= (* tptp.a tptp.a) 2))) :rule and_neg)
% 0.34/0.61  (step t188.t19.t44 (cl (= (= (< (- 2.0) 0) true) (< (- 2.0) 0))) :rule equiv_simplify)
% 0.34/0.61  (step t188.t19.t45 (cl (not (= (< (- 2.0) 0) true)) (< (- 2.0) 0)) :rule equiv1 :premises (t188.t19.t44))
% 0.34/0.61  (step t188.t19.t46 (cl (= (< (- 2.0) 0) true)) :rule hole :args ((< (- 2.0) 0)))
% 0.34/0.61  (step t188.t19.t47 (cl (< (- 2.0) 0)) :rule resolution :premises (t188.t19.t45 t188.t19.t46))
% 0.34/0.61  (step t188.t19.t48 (cl (and (< (- 2.0) 0) (>= (* tptp.a tptp.a) 2))) :rule resolution :premises (t188.t19.t43 t188.t19.t47 t188.a0))
% 0.34/0.61  (step t188.t19.t49 (cl (<= (* (- 2.0) (* tptp.a tptp.a)) (* (- 2.0) 2))) :rule resolution :premises (t188.t19.t42 t188.t19.t48))
% 0.34/0.61  (step t188.t19.t50 (cl (< (+ (* 1.0 (* tptp.a tptp.a tptp.a)) (* 1.0 (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a)))) (* (- 2.0) (* tptp.a tptp.a))) (+ (* 1.0 3) (* 1.0 1) (* (- 2.0) 2)))) :rule resolution :premises (t188.t19.t22 t188.t19.t31 t188.t19.t40 t188.t19.t49))
% 0.34/0.61  (step t188.t19.t51 (cl false) :rule resolution :premises (t188.t19.t1 t188.t19.t21 t188.t19.t50))
% 0.34/0.61  (step t188.t19 (cl (not (<= (* tptp.a tptp.a tptp.a) 3)) false) :rule subproof :discharge (t188.t19.a0))
% 0.34/0.61  (step t188.t20 (cl (=> (<= (* tptp.a tptp.a tptp.a) 3) false) false) :rule resolution :premises (t188.t18 t188.t19))
% 0.34/0.61  (step t188.t21 (cl (=> (<= (* tptp.a tptp.a tptp.a) 3) false) (not false)) :rule implies_neg2)
% 0.34/0.61  (step t188.t22 (cl (=> (<= (* tptp.a tptp.a tptp.a) 3) false) (=> (<= (* tptp.a tptp.a tptp.a) 3) false)) :rule resolution :premises (t188.t20 t188.t21))
% 0.34/0.61  (step t188.t23 (cl (=> (<= (* tptp.a tptp.a tptp.a) 3) false)) :rule contraction :premises (t188.t22))
% 0.34/0.61  (step t188.t24 (cl (= (=> (<= (* tptp.a tptp.a tptp.a) 3) false) (not (<= (* tptp.a tptp.a tptp.a) 3)))) :rule implies_simplify)
% 0.34/0.61  (step t188.t25 (cl (not (=> (<= (* tptp.a tptp.a tptp.a) 3) false)) (not (<= (* tptp.a tptp.a tptp.a) 3))) :rule equiv1 :premises (t188.t24))
% 0.34/0.61  (step t188.t26 (cl (not (<= (* tptp.a tptp.a tptp.a) 3))) :rule resolution :premises (t188.t23 t188.t25))
% 0.34/0.61  (step t188.t27 (cl (> (* tptp.a tptp.a tptp.a) 3)) :rule resolution :premises (t188.t15 t188.t17 t188.t26))
% 0.34/0.61  (step t188.t28 (cl (not (<= (* tptp.a tptp.a tptp.a) 3))) :rule resolution :premises (t188.t7 t188.t14 t188.t27))
% 0.34/0.61  (step t188.t29 (cl) :rule resolution :premises (t188.t6 t188.t28))
% 0.34/0.61  (step t188 (cl (not (>= (* tptp.a tptp.a) 2)) (not (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1))) (not (not (>= (* tptp.a tptp.a tptp.a) 4))) false) :rule subproof :discharge (t188.a0 t188.a1 t188.a2))
% 0.34/0.61  (step t189 (cl (not (and (>= (* tptp.a tptp.a) 2) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (not (>= (* tptp.a tptp.a tptp.a) 4)))) (>= (* tptp.a tptp.a) 2)) :rule and_pos)
% 0.34/0.61  (step t190 (cl (not (and (>= (* tptp.a tptp.a) 2) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (not (>= (* tptp.a tptp.a tptp.a) 4)))) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1))) :rule and_pos)
% 0.34/0.61  (step t191 (cl (not (and (>= (* tptp.a tptp.a) 2) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (not (>= (* tptp.a tptp.a tptp.a) 4)))) (not (>= (* tptp.a tptp.a tptp.a) 4))) :rule and_pos)
% 0.34/0.61  (step t192 (cl false (not (and (>= (* tptp.a tptp.a) 2) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (not (>= (* tptp.a tptp.a tptp.a) 4)))) (not (and (>= (* tptp.a tptp.a) 2) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (not (>= (* tptp.a tptp.a tptp.a) 4)))) (not (and (>= (* tptp.a tptp.a) 2) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (not (>= (* tptp.a tptp.a tptp.a) 4))))) :rule resolution :premises (t188 t189 t190 t191))
% 0.34/0.61  (step t193 (cl (not (and (>= (* tptp.a tptp.a) 2) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (not (>= (* tptp.a tptp.a tptp.a) 4)))) (not (and (>= (* tptp.a tptp.a) 2) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (not (>= (* tptp.a tptp.a tptp.a) 4)))) (not (and (>= (* tptp.a tptp.a) 2) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (not (>= (* tptp.a tptp.a tptp.a) 4)))) false) :rule reordering :premises (t192))
% 0.34/0.61  (step t194 (cl (not (and (>= (* tptp.a tptp.a) 2) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (not (>= (* tptp.a tptp.a tptp.a) 4)))) false) :rule contraction :premises (t193))
% 0.34/0.61  (step t195 (cl (=> (and (>= (* tptp.a tptp.a) 2) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (not (>= (* tptp.a tptp.a tptp.a) 4))) false) false) :rule resolution :premises (t187 t194))
% 0.34/0.61  (step t196 (cl (=> (and (>= (* tptp.a tptp.a) 2) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (not (>= (* tptp.a tptp.a tptp.a) 4))) false) (not false)) :rule implies_neg2)
% 0.34/0.61  (step t197 (cl (=> (and (>= (* tptp.a tptp.a) 2) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (not (>= (* tptp.a tptp.a tptp.a) 4))) false) (=> (and (>= (* tptp.a tptp.a) 2) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (not (>= (* tptp.a tptp.a tptp.a) 4))) false)) :rule resolution :premises (t195 t196))
% 0.34/0.61  (step t198 (cl (=> (and (>= (* tptp.a tptp.a) 2) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (not (>= (* tptp.a tptp.a tptp.a) 4))) false)) :rule contraction :premises (t197))
% 0.34/0.61  (step t199 (cl (= (=> (and (>= (* tptp.a tptp.a) 2) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (not (>= (* tptp.a tptp.a tptp.a) 4))) false) (not (and (>= (* tptp.a tptp.a) 2) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (not (>= (* tptp.a tptp.a tptp.a) 4)))))) :rule implies_simplify)
% 0.34/0.61  (step t200 (cl (not (=> (and (>= (* tptp.a tptp.a) 2) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (not (>= (* tptp.a tptp.a tptp.a) 4))) false)) (not (and (>= (* tptp.a tptp.a) 2) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (not (>= (* tptp.a tptp.a tptp.a) 4))))) :rule equiv1 :premises (t199))
% 0.34/0.61  (step t201 (cl (not (and (>= (* tptp.a tptp.a) 2) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (not (>= (* tptp.a tptp.a tptp.a) 4))))) :rule resolution :premises (t198 t200))
% 0.34/0.61  (step t202 (cl (= (and (>= (* tptp.a tptp.a) 2) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (not (>= (* tptp.a tptp.a tptp.a) 4))) false)) :rule resolution :premises (t186 t201))
% 0.34/0.61  (step t203 (cl (= (=> (and (not (>= (* tptp.a tptp.a tptp.a) 4)) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (>= (* tptp.a tptp.a) 2)) (and (>= (* tptp.a tptp.a) 2) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (not (>= (* tptp.a tptp.a tptp.a) 4)))) (=> (and (not (>= (* tptp.a tptp.a tptp.a) 4)) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (>= (* tptp.a tptp.a) 2)) false))) :rule cong :premises (t182 t202))
% 0.34/0.61  (step t204 (cl (= (=> (and (not (>= (* tptp.a tptp.a tptp.a) 4)) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (>= (* tptp.a tptp.a) 2)) false) (not (and (not (>= (* tptp.a tptp.a tptp.a) 4)) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (>= (* tptp.a tptp.a) 2))))) :rule all_simplify)
% 0.34/0.61  (step t205 (cl (= (=> (and (not (>= (* tptp.a tptp.a tptp.a) 4)) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (>= (* tptp.a tptp.a) 2)) (and (>= (* tptp.a tptp.a) 2) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (not (>= (* tptp.a tptp.a tptp.a) 4)))) (not (and (not (>= (* tptp.a tptp.a tptp.a) 4)) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (>= (* tptp.a tptp.a) 2))))) :rule trans :premises (t203 t204))
% 0.34/0.61  (step t206 (cl (=> (and (not (>= (* tptp.a tptp.a tptp.a) 4)) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (>= (* tptp.a tptp.a) 2)) (and (>= (* tptp.a tptp.a) 2) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (not (>= (* tptp.a tptp.a tptp.a) 4)))) (and (not (>= (* tptp.a tptp.a tptp.a) 4)) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (>= (* tptp.a tptp.a) 2))) :rule implies_neg1)
% 0.34/0.61  (anchor :step t207)
% 0.34/0.61  (assume t207.a0 (not (>= (* tptp.a tptp.a tptp.a) 4)))
% 0.34/0.61  (assume t207.a1 (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)))
% 0.34/0.61  (assume t207.a2 (>= (* tptp.a tptp.a) 2))
% 0.34/0.61  (step t207.t1 (cl (and (>= (* tptp.a tptp.a) 2) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (not (>= (* tptp.a tptp.a tptp.a) 4))) (not (>= (* tptp.a tptp.a) 2)) (not (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1))) (not (not (>= (* tptp.a tptp.a tptp.a) 4)))) :rule and_neg)
% 0.34/0.61  (step t207.t2 (cl (and (>= (* tptp.a tptp.a) 2) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (not (>= (* tptp.a tptp.a tptp.a) 4)))) :rule resolution :premises (t207.t1 t207.a2 t207.a1 t207.a0))
% 0.34/0.61  (step t207 (cl (not (not (>= (* tptp.a tptp.a tptp.a) 4))) (not (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1))) (not (>= (* tptp.a tptp.a) 2)) (and (>= (* tptp.a tptp.a) 2) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (not (>= (* tptp.a tptp.a tptp.a) 4)))) :rule subproof :discharge (t207.a0 t207.a1 t207.a2))
% 0.34/0.61  (step t208 (cl (not (and (not (>= (* tptp.a tptp.a tptp.a) 4)) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (>= (* tptp.a tptp.a) 2))) (not (>= (* tptp.a tptp.a tptp.a) 4))) :rule and_pos)
% 0.34/0.61  (step t209 (cl (not (and (not (>= (* tptp.a tptp.a tptp.a) 4)) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (>= (* tptp.a tptp.a) 2))) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1))) :rule and_pos)
% 0.34/0.61  (step t210 (cl (not (and (not (>= (* tptp.a tptp.a tptp.a) 4)) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (>= (* tptp.a tptp.a) 2))) (>= (* tptp.a tptp.a) 2)) :rule and_pos)
% 0.34/0.61  (step t211 (cl (and (>= (* tptp.a tptp.a) 2) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (not (>= (* tptp.a tptp.a tptp.a) 4))) (not (and (not (>= (* tptp.a tptp.a tptp.a) 4)) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (>= (* tptp.a tptp.a) 2))) (not (and (not (>= (* tptp.a tptp.a tptp.a) 4)) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (>= (* tptp.a tptp.a) 2))) (not (and (not (>= (* tptp.a tptp.a tptp.a) 4)) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (>= (* tptp.a tptp.a) 2)))) :rule resolution :premises (t207 t208 t209 t210))
% 0.34/0.61  (step t212 (cl (not (and (not (>= (* tptp.a tptp.a tptp.a) 4)) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (>= (* tptp.a tptp.a) 2))) (not (and (not (>= (* tptp.a tptp.a tptp.a) 4)) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (>= (* tptp.a tptp.a) 2))) (not (and (not (>= (* tptp.a tptp.a tptp.a) 4)) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (>= (* tptp.a tptp.a) 2))) (and (>= (* tptp.a tptp.a) 2) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (not (>= (* tptp.a tptp.a tptp.a) 4)))) :rule reordering :premises (t211))
% 0.34/0.61  (step t213 (cl (not (and (not (>= (* tptp.a tptp.a tptp.a) 4)) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (>= (* tptp.a tptp.a) 2))) (and (>= (* tptp.a tptp.a) 2) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (not (>= (* tptp.a tptp.a tptp.a) 4)))) :rule contraction :premises (t212))
% 0.34/0.61  (step t214 (cl (=> (and (not (>= (* tptp.a tptp.a tptp.a) 4)) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (>= (* tptp.a tptp.a) 2)) (and (>= (* tptp.a tptp.a) 2) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (not (>= (* tptp.a tptp.a tptp.a) 4)))) (and (>= (* tptp.a tptp.a) 2) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (not (>= (* tptp.a tptp.a tptp.a) 4)))) :rule resolution :premises (t206 t213))
% 0.34/0.61  (step t215 (cl (=> (and (not (>= (* tptp.a tptp.a tptp.a) 4)) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (>= (* tptp.a tptp.a) 2)) (and (>= (* tptp.a tptp.a) 2) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (not (>= (* tptp.a tptp.a tptp.a) 4)))) (not (and (>= (* tptp.a tptp.a) 2) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (not (>= (* tptp.a tptp.a tptp.a) 4))))) :rule implies_neg2)
% 0.34/0.61  (step t216 (cl (=> (and (not (>= (* tptp.a tptp.a tptp.a) 4)) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (>= (* tptp.a tptp.a) 2)) (and (>= (* tptp.a tptp.a) 2) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (not (>= (* tptp.a tptp.a tptp.a) 4)))) (=> (and (not (>= (* tptp.a tptp.a tptp.a) 4)) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (>= (* tptp.a tptp.a) 2)) (and (>= (* tptp.a tptp.a) 2) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (not (>= (* tptp.a tptp.a tptp.a) 4))))) :rule resolution :premises (t214 t215))
% 0.34/0.61  (step t217 (cl (=> (and (not (>= (* tptp.a tptp.a tptp.a) 4)) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (>= (* tptp.a tptp.a) 2)) (and (>= (* tptp.a tptp.a) 2) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (not (>= (* tptp.a tptp.a tptp.a) 4))))) :rule contraction :premises (t216))
% 0.34/0.61  (step t218 (cl (not (and (not (>= (* tptp.a tptp.a tptp.a) 4)) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (>= (* tptp.a tptp.a) 2)))) :rule resolution :premises (t181 t205 t217))
% 0.34/0.61  (step t219 (cl (not (not (>= (* tptp.a tptp.a tptp.a) 4))) (not (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1))) (not (>= (* tptp.a tptp.a) 2))) :rule not_and :premises (t218))
% 0.34/0.61  (step t220 (cl (or (not (not (>= (* tptp.a tptp.a tptp.a) 4))) (not (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1))) (not (>= (* tptp.a tptp.a) 2))) (not (not (not (>= (* tptp.a tptp.a tptp.a) 4))))) :rule or_neg)
% 0.34/0.61  (step t221 (cl (or (not (not (>= (* tptp.a tptp.a tptp.a) 4))) (not (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1))) (not (>= (* tptp.a tptp.a) 2))) (not (not (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1))))) :rule or_neg)
% 0.34/0.61  (step t222 (cl (or (not (not (>= (* tptp.a tptp.a tptp.a) 4))) (not (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1))) (not (>= (* tptp.a tptp.a) 2))) (not (not (>= (* tptp.a tptp.a) 2)))) :rule or_neg)
% 0.34/0.61  (step t223 (cl (or (not (not (>= (* tptp.a tptp.a tptp.a) 4))) (not (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1))) (not (>= (* tptp.a tptp.a) 2))) (or (not (not (>= (* tptp.a tptp.a tptp.a) 4))) (not (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1))) (not (>= (* tptp.a tptp.a) 2))) (or (not (not (>= (* tptp.a tptp.a tptp.a) 4))) (not (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1))) (not (>= (* tptp.a tptp.a) 2)))) :rule resolution :premises (t219 t220 t221 t222))
% 0.34/0.61  (step t224 (cl (or (not (not (>= (* tptp.a tptp.a tptp.a) 4))) (not (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1))) (not (>= (* tptp.a tptp.a) 2)))) :rule contraction :premises (t223))
% 0.34/0.61  (step t225 (cl (or (>= (* tptp.a tptp.a tptp.a) 4) (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1) (not (>= (* tptp.a tptp.a) 2)))) :rule resolution :premises (t158 t180 t224))
% 0.34/0.61  (step t226 (cl (>= (* tptp.a tptp.a tptp.a) 4) (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1) (not (>= (* tptp.a tptp.a) 2))) :rule or :premises (t225))
% 0.34/0.61  (step t227 (cl (not (ite (>= (* tptp.a tptp.a) 0) (>= (* tptp.a tptp.a) 2) (not (>= (* tptp.a tptp.a) (- 1))))) (not (>= (* tptp.a tptp.a) 0)) (>= (* tptp.a tptp.a) 2)) :rule ite_pos2)
% 0.34/0.61  (step t228 (cl (>= (* tptp.a tptp.a) 2) (not (>= (* tptp.a tptp.a) 0)) (not (ite (>= (* tptp.a tptp.a) 0) (>= (* tptp.a tptp.a) 2) (not (>= (* tptp.a tptp.a) (- 1)))))) :rule reordering :premises (t227))
% 0.34/0.61  (step t229 (cl (not (= (or (not (>= (* tptp.a tptp.a) 1)) (not (not (>= (* tptp.a tptp.a) 0)))) (or (not (>= (* tptp.a tptp.a) 1)) (>= (* tptp.a tptp.a) 0)))) (not (or (not (>= (* tptp.a tptp.a) 1)) (not (not (>= (* tptp.a tptp.a) 0))))) (or (not (>= (* tptp.a tptp.a) 1)) (>= (* tptp.a tptp.a) 0))) :rule equiv_pos2)
% 0.34/0.61  (step t230 (cl (= (not (>= (* tptp.a tptp.a) 1)) (not (>= (* tptp.a tptp.a) 1)))) :rule refl)
% 0.34/0.61  (step t231 (cl (= (not (not (>= (* tptp.a tptp.a) 0))) (>= (* tptp.a tptp.a) 0))) :rule all_simplify)
% 0.34/0.61  (step t232 (cl (= (or (not (>= (* tptp.a tptp.a) 1)) (not (not (>= (* tptp.a tptp.a) 0)))) (or (not (>= (* tptp.a tptp.a) 1)) (>= (* tptp.a tptp.a) 0)))) :rule cong :premises (t230 t231))
% 0.34/0.61  (step t233 (cl (not (= (=> (and (>= (* tptp.a tptp.a) 1) (not (>= (* tptp.a tptp.a) 0))) (and (not (>= (* tptp.a tptp.a) 0)) (>= (* tptp.a tptp.a) 1))) (not (and (>= (* tptp.a tptp.a) 1) (not (>= (* tptp.a tptp.a) 0)))))) (not (=> (and (>= (* tptp.a tptp.a) 1) (not (>= (* tptp.a tptp.a) 0))) (and (not (>= (* tptp.a tptp.a) 0)) (>= (* tptp.a tptp.a) 1)))) (not (and (>= (* tptp.a tptp.a) 1) (not (>= (* tptp.a tptp.a) 0))))) :rule equiv_pos2)
% 0.34/0.61  (step t234 (cl (= (and (>= (* tptp.a tptp.a) 1) (not (>= (* tptp.a tptp.a) 0))) (and (>= (* tptp.a tptp.a) 1) (not (>= (* tptp.a tptp.a) 0))))) :rule refl)
% 0.34/0.61  (step t235 (cl (= (= (and (not (>= (* tptp.a tptp.a) 0)) (>= (* tptp.a tptp.a) 1)) false) (not (and (not (>= (* tptp.a tptp.a) 0)) (>= (* tptp.a tptp.a) 1))))) :rule equiv_simplify)
% 0.34/0.61  (step t236 (cl (= (and (not (>= (* tptp.a tptp.a) 0)) (>= (* tptp.a tptp.a) 1)) false) (not (not (and (not (>= (* tptp.a tptp.a) 0)) (>= (* tptp.a tptp.a) 1))))) :rule equiv2 :premises (t235))
% 0.34/0.61  (step t237 (cl (not (not (not (and (not (>= (* tptp.a tptp.a) 0)) (>= (* tptp.a tptp.a) 1))))) (and (not (>= (* tptp.a tptp.a) 0)) (>= (* tptp.a tptp.a) 1))) :rule not_not)
% 0.34/0.61  (step t238 (cl (= (and (not (>= (* tptp.a tptp.a) 0)) (>= (* tptp.a tptp.a) 1)) false) (and (not (>= (* tptp.a tptp.a) 0)) (>= (* tptp.a tptp.a) 1))) :rule resolution :premises (t236 t237))
% 0.34/0.61  (step t239 (cl (=> (and (not (>= (* tptp.a tptp.a) 0)) (>= (* tptp.a tptp.a) 1)) false) (and (not (>= (* tptp.a tptp.a) 0)) (>= (* tptp.a tptp.a) 1))) :rule implies_neg1)
% 0.34/0.61  (anchor :step t240)
% 0.34/0.61  (assume t240.a0 (not (>= (* tptp.a tptp.a) 0)))
% 0.34/0.61  (assume t240.a1 (>= (* tptp.a tptp.a) 1))
% 0.34/0.61  (step t240.t1 (cl (not (= (not (<= (* tptp.a tptp.a) (- 1))) (> (* tptp.a tptp.a) (- 1)))) (not (not (<= (* tptp.a tptp.a) (- 1)))) (> (* tptp.a tptp.a) (- 1))) :rule equiv_pos2)
% 0.34/0.61  (step t240.t2 (cl (= (<= (* tptp.a tptp.a) (- 1)) (not (>= (* tptp.a tptp.a) 0)))) :rule all_simplify)
% 0.34/0.61  (step t240.t3 (cl (= (not (<= (* tptp.a tptp.a) (- 1))) (not (not (>= (* tptp.a tptp.a) 0))))) :rule cong :premises (t240.t2))
% 0.34/0.61  (step t240.t4 (cl (= (not (not (>= (* tptp.a tptp.a) 0))) (>= (* tptp.a tptp.a) 0))) :rule all_simplify)
% 0.34/0.61  (step t240.t5 (cl (= (not (<= (* tptp.a tptp.a) (- 1))) (>= (* tptp.a tptp.a) 0))) :rule trans :premises (t240.t3 t240.t4))
% 0.34/0.61  (step t240.t6 (cl (= (> (* tptp.a tptp.a) (- 1)) (not (<= (* tptp.a tptp.a) (- 1))))) :rule all_simplify)
% 0.34/0.61  (step t240.t7 (cl (= (> (* tptp.a tptp.a) (- 1)) (>= (* tptp.a tptp.a) 0))) :rule trans :premises (t240.t6 t240.t5))
% 0.34/0.61  (step t240.t8 (cl (= (>= (* tptp.a tptp.a) 0) (> (* tptp.a tptp.a) (- 1)))) :rule symm :premises (t240.t7))
% 0.34/0.61  (step t240.t9 (cl (= (not (<= (* tptp.a tptp.a) (- 1))) (> (* tptp.a tptp.a) (- 1)))) :rule trans :premises (t240.t5 t240.t8))
% 0.34/0.61  (step t240.t10 (cl (=> (<= (* tptp.a tptp.a) (- 1)) false) (<= (* tptp.a tptp.a) (- 1))) :rule implies_neg1)
% 0.34/0.61  (anchor :step t240.t11)
% 0.34/0.61  (assume t240.t11.a0 (<= (* tptp.a tptp.a) (- 1)))
% 0.34/0.61  (step t240.t11.t1 (cl (not (= (<= (+ (* 1.0 (* tptp.a tptp.a)) (* (- 1.0) (* tptp.a tptp.a))) (+ (* 1.0 (- 1)) (* (- 1.0) 1))) false)) (not (<= (+ (* 1.0 (* tptp.a tptp.a)) (* (- 1.0) (* tptp.a tptp.a))) (+ (* 1.0 (- 1)) (* (- 1.0) 1)))) false) :rule equiv_pos2)
% 0.34/0.61  (step t240.t11.t2 (cl (= (* 1.0 (* tptp.a tptp.a)) (to_real (* tptp.a tptp.a)))) :rule all_simplify)
% 0.34/0.61  (step t240.t11.t3 (cl (= (* (- 1.0) (* tptp.a tptp.a)) (to_real (* (- 1) (* tptp.a tptp.a))))) :rule all_simplify)
% 0.34/0.61  (step t240.t11.t4 (cl (= (+ (* 1.0 (* tptp.a tptp.a)) (* (- 1.0) (* tptp.a tptp.a))) (+ (to_real (* tptp.a tptp.a)) (to_real (* (- 1) (* tptp.a tptp.a)))))) :rule cong :premises (t240.t11.t2 t240.t11.t3))
% 0.34/0.61  (step t240.t11.t5 (cl (= (+ (to_real (* tptp.a tptp.a)) (to_real (* (- 1) (* tptp.a tptp.a)))) 0.0)) :rule all_simplify)
% 0.34/0.61  (step t240.t11.t6 (cl (= (+ (* 1.0 (* tptp.a tptp.a)) (* (- 1.0) (* tptp.a tptp.a))) 0.0)) :rule trans :premises (t240.t11.t4 t240.t11.t5))
% 0.34/0.61  (step t240.t11.t7 (cl (= (* 1.0 (- 1)) (- 1.0))) :rule all_simplify)
% 0.34/0.61  (step t240.t11.t8 (cl (= (* (- 1.0) 1) (- 1.0))) :rule all_simplify)
% 0.34/0.61  (step t240.t11.t9 (cl (= (+ (* 1.0 (- 1)) (* (- 1.0) 1)) (+ (- 1.0) (- 1.0)))) :rule cong :premises (t240.t11.t7 t240.t11.t8))
% 0.34/0.61  (step t240.t11.t10 (cl (= (+ (- 1.0) (- 1.0)) (- 2.0))) :rule all_simplify)
% 0.34/0.61  (step t240.t11.t11 (cl (= (+ (* 1.0 (- 1)) (* (- 1.0) 1)) (- 2.0))) :rule trans :premises (t240.t11.t9 t240.t11.t10))
% 0.34/0.61  (step t240.t11.t12 (cl (= (<= (+ (* 1.0 (* tptp.a tptp.a)) (* (- 1.0) (* tptp.a tptp.a))) (+ (* 1.0 (- 1)) (* (- 1.0) 1))) (<= 0.0 (- 2.0)))) :rule cong :premises (t240.t11.t6 t240.t11.t11))
% 0.34/0.61  (step t240.t11.t13 (cl (= (<= 0.0 (- 2.0)) false)) :rule all_simplify)
% 0.34/0.61  (step t240.t11.t14 (cl (= (<= (+ (* 1.0 (* tptp.a tptp.a)) (* (- 1.0) (* tptp.a tptp.a))) (+ (* 1.0 (- 1)) (* (- 1.0) 1))) false)) :rule trans :premises (t240.t11.t12 t240.t11.t13))
% 0.34/0.61  (step t240.t11.t15 (cl (not (<= (* 1.0 (* tptp.a tptp.a)) (* 1.0 (- 1)))) (not (<= (* (- 1.0) (* tptp.a tptp.a)) (* (- 1.0) 1))) (<= (+ (* 1.0 (* tptp.a tptp.a)) (* (- 1.0) (* tptp.a tptp.a))) (+ (* 1.0 (- 1)) (* (- 1.0) 1)))) :rule la_generic :args (1 1 1))
% 0.34/0.61  (step t240.t11.t16 (cl (=> (and (> 1.0 0) (<= (* tptp.a tptp.a) (- 1))) (<= (* 1.0 (* tptp.a tptp.a)) (* 1.0 (- 1))))) :rule la_mult_pos)
% 0.34/0.61  (step t240.t11.t17 (cl (not (and (> 1.0 0) (<= (* tptp.a tptp.a) (- 1)))) (<= (* 1.0 (* tptp.a tptp.a)) (* 1.0 (- 1)))) :rule implies :premises (t240.t11.t16))
% 0.34/0.61  (step t240.t11.t18 (cl (and (> 1.0 0) (<= (* tptp.a tptp.a) (- 1))) (not (> 1.0 0)) (not (<= (* tptp.a tptp.a) (- 1)))) :rule and_neg)
% 0.34/0.61  (step t240.t11.t19 (cl (= (= (> 1.0 0) true) (> 1.0 0))) :rule equiv_simplify)
% 0.34/0.61  (step t240.t11.t20 (cl (not (= (> 1.0 0) true)) (> 1.0 0)) :rule equiv1 :premises (t240.t11.t19))
% 0.34/0.61  (step t240.t11.t21 (cl (= (> 1.0 0) true)) :rule hole :args ((> 1.0 0)))
% 0.34/0.61  (step t240.t11.t22 (cl (> 1.0 0)) :rule resolution :premises (t240.t11.t20 t240.t11.t21))
% 0.34/0.61  (step t240.t11.t23 (cl (and (> 1.0 0) (<= (* tptp.a tptp.a) (- 1)))) :rule resolution :premises (t240.t11.t18 t240.t11.t22 t240.t11.a0))
% 0.34/0.61  (step t240.t11.t24 (cl (<= (* 1.0 (* tptp.a tptp.a)) (* 1.0 (- 1)))) :rule resolution :premises (t240.t11.t17 t240.t11.t23))
% 0.34/0.61  (step t240.t11.t25 (cl (=> (and (< (- 1.0) 0) (>= (* tptp.a tptp.a) 1)) (<= (* (- 1.0) (* tptp.a tptp.a)) (* (- 1.0) 1)))) :rule la_mult_neg)
% 0.34/0.61  (step t240.t11.t26 (cl (not (and (< (- 1.0) 0) (>= (* tptp.a tptp.a) 1))) (<= (* (- 1.0) (* tptp.a tptp.a)) (* (- 1.0) 1))) :rule implies :premises (t240.t11.t25))
% 0.34/0.61  (step t240.t11.t27 (cl (and (< (- 1.0) 0) (>= (* tptp.a tptp.a) 1)) (not (< (- 1.0) 0)) (not (>= (* tptp.a tptp.a) 1))) :rule and_neg)
% 0.34/0.61  (step t240.t11.t28 (cl (= (= (< (- 1.0) 0) true) (< (- 1.0) 0))) :rule equiv_simplify)
% 0.34/0.61  (step t240.t11.t29 (cl (not (= (< (- 1.0) 0) true)) (< (- 1.0) 0)) :rule equiv1 :premises (t240.t11.t28))
% 0.34/0.61  (step t240.t11.t30 (cl (= (< (- 1.0) 0) true)) :rule hole :args ((< (- 1.0) 0)))
% 0.34/0.61  (step t240.t11.t31 (cl (< (- 1.0) 0)) :rule resolution :premises (t240.t11.t29 t240.t11.t30))
% 0.34/0.61  (step t240.t11.t32 (cl (and (< (- 1.0) 0) (>= (* tptp.a tptp.a) 1))) :rule resolution :premises (t240.t11.t27 t240.t11.t31 t240.a1))
% 0.34/0.61  (step t240.t11.t33 (cl (<= (* (- 1.0) (* tptp.a tptp.a)) (* (- 1.0) 1))) :rule resolution :premises (t240.t11.t26 t240.t11.t32))
% 0.34/0.61  (step t240.t11.t34 (cl (<= (+ (* 1.0 (* tptp.a tptp.a)) (* (- 1.0) (* tptp.a tptp.a))) (+ (* 1.0 (- 1)) (* (- 1.0) 1)))) :rule resolution :premises (t240.t11.t15 t240.t11.t24 t240.t11.t33))
% 0.34/0.61  (step t240.t11.t35 (cl false) :rule resolution :premises (t240.t11.t1 t240.t11.t14 t240.t11.t34))
% 0.34/0.61  (step t240.t11 (cl (not (<= (* tptp.a tptp.a) (- 1))) false) :rule subproof :discharge (t240.t11.a0))
% 0.34/0.61  (step t240.t12 (cl (=> (<= (* tptp.a tptp.a) (- 1)) false) false) :rule resolution :premises (t240.t10 t240.t11))
% 0.34/0.61  (step t240.t13 (cl (=> (<= (* tptp.a tptp.a) (- 1)) false) (not false)) :rule implies_neg2)
% 0.34/0.61  (step t240.t14 (cl (=> (<= (* tptp.a tptp.a) (- 1)) false) (=> (<= (* tptp.a tptp.a) (- 1)) false)) :rule resolution :premises (t240.t12 t240.t13))
% 0.34/0.61  (step t240.t15 (cl (=> (<= (* tptp.a tptp.a) (- 1)) false)) :rule contraction :premises (t240.t14))
% 0.34/0.61  (step t240.t16 (cl (= (=> (<= (* tptp.a tptp.a) (- 1)) false) (not (<= (* tptp.a tptp.a) (- 1))))) :rule implies_simplify)
% 0.34/0.61  (step t240.t17 (cl (not (=> (<= (* tptp.a tptp.a) (- 1)) false)) (not (<= (* tptp.a tptp.a) (- 1)))) :rule equiv1 :premises (t240.t16))
% 0.34/0.61  (step t240.t18 (cl (not (<= (* tptp.a tptp.a) (- 1)))) :rule resolution :premises (t240.t15 t240.t17))
% 0.34/0.61  (step t240.t19 (cl (> (* tptp.a tptp.a) (- 1))) :rule resolution :premises (t240.t1 t240.t9 t240.t18))
% 0.34/0.61  (step t240.t20 (cl (not (= (<= (* tptp.a tptp.a) (- 1)) (not (> (* tptp.a tptp.a) (- 1))))) (not (<= (* tptp.a tptp.a) (- 1))) (not (> (* tptp.a tptp.a) (- 1)))) :rule equiv_pos2)
% 0.34/0.61  (step t240.t21 (cl (= (not (> (* tptp.a tptp.a) (- 1))) (not (>= (* tptp.a tptp.a) 0)))) :rule cong :premises (t240.t7))
% 0.34/0.61  (step t240.t22 (cl (= (not (>= (* tptp.a tptp.a) 0)) (not (> (* tptp.a tptp.a) (- 1))))) :rule symm :premises (t240.t21))
% 0.34/0.61  (step t240.t23 (cl (= (<= (* tptp.a tptp.a) (- 1)) (not (> (* tptp.a tptp.a) (- 1))))) :rule trans :premises (t240.t2 t240.t22))
% 0.34/0.61  (step t240.t24 (cl (not (< (* tptp.a tptp.a) 0)) (<= (* tptp.a tptp.a) (- 1))) :rule la_generic :args (1 1))
% 0.34/0.61  (step t240.t25 (cl (not (= (not (>= (* tptp.a tptp.a) 0)) (< (* tptp.a tptp.a) 0))) (not (not (>= (* tptp.a tptp.a) 0))) (< (* tptp.a tptp.a) 0)) :rule equiv_pos2)
% 0.34/0.61  (step t240.t26 (cl (= (< (* tptp.a tptp.a) 0) (not (>= (* tptp.a tptp.a) 0)))) :rule all_simplify)
% 0.34/0.61  (step t240.t27 (cl (= (not (>= (* tptp.a tptp.a) 0)) (< (* tptp.a tptp.a) 0))) :rule symm :premises (t240.t26))
% 0.34/0.61  (step t240.t28 (cl (< (* tptp.a tptp.a) 0)) :rule resolution :premises (t240.t25 t240.t27 t240.a0))
% 0.34/0.61  (step t240.t29 (cl (<= (* tptp.a tptp.a) (- 1))) :rule resolution :premises (t240.t24 t240.t28))
% 0.34/0.61  (step t240.t30 (cl (not (> (* tptp.a tptp.a) (- 1)))) :rule resolution :premises (t240.t20 t240.t23 t240.t29))
% 0.34/0.61  (step t240.t31 (cl) :rule resolution :premises (t240.t19 t240.t30))
% 0.34/0.61  (step t240 (cl (not (not (>= (* tptp.a tptp.a) 0))) (not (>= (* tptp.a tptp.a) 1)) false) :rule subproof :discharge (t240.a0 t240.a1))
% 0.34/0.61  (step t241 (cl (not (and (not (>= (* tptp.a tptp.a) 0)) (>= (* tptp.a tptp.a) 1))) (not (>= (* tptp.a tptp.a) 0))) :rule and_pos)
% 0.34/0.61  (step t242 (cl (not (and (not (>= (* tptp.a tptp.a) 0)) (>= (* tptp.a tptp.a) 1))) (>= (* tptp.a tptp.a) 1)) :rule and_pos)
% 0.34/0.61  (step t243 (cl false (not (and (not (>= (* tptp.a tptp.a) 0)) (>= (* tptp.a tptp.a) 1))) (not (and (not (>= (* tptp.a tptp.a) 0)) (>= (* tptp.a tptp.a) 1)))) :rule resolution :premises (t240 t241 t242))
% 0.34/0.61  (step t244 (cl (not (and (not (>= (* tptp.a tptp.a) 0)) (>= (* tptp.a tptp.a) 1))) (not (and (not (>= (* tptp.a tptp.a) 0)) (>= (* tptp.a tptp.a) 1))) false) :rule reordering :premises (t243))
% 0.34/0.61  (step t245 (cl (not (and (not (>= (* tptp.a tptp.a) 0)) (>= (* tptp.a tptp.a) 1))) false) :rule contraction :premises (t244))
% 0.34/0.61  (step t246 (cl (=> (and (not (>= (* tptp.a tptp.a) 0)) (>= (* tptp.a tptp.a) 1)) false) false) :rule resolution :premises (t239 t245))
% 0.34/0.61  (step t247 (cl (=> (and (not (>= (* tptp.a tptp.a) 0)) (>= (* tptp.a tptp.a) 1)) false) (not false)) :rule implies_neg2)
% 0.34/0.61  (step t248 (cl (=> (and (not (>= (* tptp.a tptp.a) 0)) (>= (* tptp.a tptp.a) 1)) false) (=> (and (not (>= (* tptp.a tptp.a) 0)) (>= (* tptp.a tptp.a) 1)) false)) :rule resolution :premises (t246 t247))
% 0.34/0.61  (step t249 (cl (=> (and (not (>= (* tptp.a tptp.a) 0)) (>= (* tptp.a tptp.a) 1)) false)) :rule contraction :premises (t248))
% 0.34/0.61  (step t250 (cl (= (=> (and (not (>= (* tptp.a tptp.a) 0)) (>= (* tptp.a tptp.a) 1)) false) (not (and (not (>= (* tptp.a tptp.a) 0)) (>= (* tptp.a tptp.a) 1))))) :rule implies_simplify)
% 0.34/0.61  (step t251 (cl (not (=> (and (not (>= (* tptp.a tptp.a) 0)) (>= (* tptp.a tptp.a) 1)) false)) (not (and (not (>= (* tptp.a tptp.a) 0)) (>= (* tptp.a tptp.a) 1)))) :rule equiv1 :premises (t250))
% 0.34/0.61  (step t252 (cl (not (and (not (>= (* tptp.a tptp.a) 0)) (>= (* tptp.a tptp.a) 1)))) :rule resolution :premises (t249 t251))
% 0.34/0.61  (step t253 (cl (= (and (not (>= (* tptp.a tptp.a) 0)) (>= (* tptp.a tptp.a) 1)) false)) :rule resolution :premises (t238 t252))
% 0.34/0.61  (step t254 (cl (= (=> (and (>= (* tptp.a tptp.a) 1) (not (>= (* tptp.a tptp.a) 0))) (and (not (>= (* tptp.a tptp.a) 0)) (>= (* tptp.a tptp.a) 1))) (=> (and (>= (* tptp.a tptp.a) 1) (not (>= (* tptp.a tptp.a) 0))) false))) :rule cong :premises (t234 t253))
% 0.34/0.61  (step t255 (cl (= (=> (and (>= (* tptp.a tptp.a) 1) (not (>= (* tptp.a tptp.a) 0))) false) (not (and (>= (* tptp.a tptp.a) 1) (not (>= (* tptp.a tptp.a) 0)))))) :rule all_simplify)
% 0.34/0.61  (step t256 (cl (= (=> (and (>= (* tptp.a tptp.a) 1) (not (>= (* tptp.a tptp.a) 0))) (and (not (>= (* tptp.a tptp.a) 0)) (>= (* tptp.a tptp.a) 1))) (not (and (>= (* tptp.a tptp.a) 1) (not (>= (* tptp.a tptp.a) 0)))))) :rule trans :premises (t254 t255))
% 0.34/0.61  (step t257 (cl (=> (and (>= (* tptp.a tptp.a) 1) (not (>= (* tptp.a tptp.a) 0))) (and (not (>= (* tptp.a tptp.a) 0)) (>= (* tptp.a tptp.a) 1))) (and (>= (* tptp.a tptp.a) 1) (not (>= (* tptp.a tptp.a) 0)))) :rule implies_neg1)
% 0.34/0.61  (anchor :step t258)
% 0.34/0.61  (assume t258.a0 (>= (* tptp.a tptp.a) 1))
% 0.34/0.61  (assume t258.a1 (not (>= (* tptp.a tptp.a) 0)))
% 0.34/0.61  (step t258.t1 (cl (and (not (>= (* tptp.a tptp.a) 0)) (>= (* tptp.a tptp.a) 1)) (not (not (>= (* tptp.a tptp.a) 0))) (not (>= (* tptp.a tptp.a) 1))) :rule and_neg)
% 0.34/0.61  (step t258.t2 (cl (and (not (>= (* tptp.a tptp.a) 0)) (>= (* tptp.a tptp.a) 1))) :rule resolution :premises (t258.t1 t258.a1 t258.a0))
% 0.34/0.61  (step t258 (cl (not (>= (* tptp.a tptp.a) 1)) (not (not (>= (* tptp.a tptp.a) 0))) (and (not (>= (* tptp.a tptp.a) 0)) (>= (* tptp.a tptp.a) 1))) :rule subproof :discharge (t258.a0 t258.a1))
% 0.34/0.61  (step t259 (cl (not (and (>= (* tptp.a tptp.a) 1) (not (>= (* tptp.a tptp.a) 0)))) (>= (* tptp.a tptp.a) 1)) :rule and_pos)
% 0.34/0.61  (step t260 (cl (not (and (>= (* tptp.a tptp.a) 1) (not (>= (* tptp.a tptp.a) 0)))) (not (>= (* tptp.a tptp.a) 0))) :rule and_pos)
% 0.34/0.61  (step t261 (cl (and (not (>= (* tptp.a tptp.a) 0)) (>= (* tptp.a tptp.a) 1)) (not (and (>= (* tptp.a tptp.a) 1) (not (>= (* tptp.a tptp.a) 0)))) (not (and (>= (* tptp.a tptp.a) 1) (not (>= (* tptp.a tptp.a) 0))))) :rule resolution :premises (t258 t259 t260))
% 0.34/0.61  (step t262 (cl (not (and (>= (* tptp.a tptp.a) 1) (not (>= (* tptp.a tptp.a) 0)))) (not (and (>= (* tptp.a tptp.a) 1) (not (>= (* tptp.a tptp.a) 0)))) (and (not (>= (* tptp.a tptp.a) 0)) (>= (* tptp.a tptp.a) 1))) :rule reordering :premises (t261))
% 0.34/0.61  (step t263 (cl (not (and (>= (* tptp.a tptp.a) 1) (not (>= (* tptp.a tptp.a) 0)))) (and (not (>= (* tptp.a tptp.a) 0)) (>= (* tptp.a tptp.a) 1))) :rule contraction :premises (t262))
% 0.34/0.61  (step t264 (cl (=> (and (>= (* tptp.a tptp.a) 1) (not (>= (* tptp.a tptp.a) 0))) (and (not (>= (* tptp.a tptp.a) 0)) (>= (* tptp.a tptp.a) 1))) (and (not (>= (* tptp.a tptp.a) 0)) (>= (* tptp.a tptp.a) 1))) :rule resolution :premises (t257 t263))
% 0.34/0.61  (step t265 (cl (=> (and (>= (* tptp.a tptp.a) 1) (not (>= (* tptp.a tptp.a) 0))) (and (not (>= (* tptp.a tptp.a) 0)) (>= (* tptp.a tptp.a) 1))) (not (and (not (>= (* tptp.a tptp.a) 0)) (>= (* tptp.a tptp.a) 1)))) :rule implies_neg2)
% 0.34/0.61  (step t266 (cl (=> (and (>= (* tptp.a tptp.a) 1) (not (>= (* tptp.a tptp.a) 0))) (and (not (>= (* tptp.a tptp.a) 0)) (>= (* tptp.a tptp.a) 1))) (=> (and (>= (* tptp.a tptp.a) 1) (not (>= (* tptp.a tptp.a) 0))) (and (not (>= (* tptp.a tptp.a) 0)) (>= (* tptp.a tptp.a) 1)))) :rule resolution :premises (t264 t265))
% 0.34/0.61  (step t267 (cl (=> (and (>= (* tptp.a tptp.a) 1) (not (>= (* tptp.a tptp.a) 0))) (and (not (>= (* tptp.a tptp.a) 0)) (>= (* tptp.a tptp.a) 1)))) :rule contraction :premises (t266))
% 0.34/0.61  (step t268 (cl (not (and (>= (* tptp.a tptp.a) 1) (not (>= (* tptp.a tptp.a) 0))))) :rule resolution :premises (t233 t256 t267))
% 0.34/0.61  (step t269 (cl (not (>= (* tptp.a tptp.a) 1)) (not (not (>= (* tptp.a tptp.a) 0)))) :rule not_and :premises (t268))
% 0.34/0.61  (step t270 (cl (or (not (>= (* tptp.a tptp.a) 1)) (not (not (>= (* tptp.a tptp.a) 0)))) (not (not (>= (* tptp.a tptp.a) 1)))) :rule or_neg)
% 0.34/0.61  (step t271 (cl (or (not (>= (* tptp.a tptp.a) 1)) (not (not (>= (* tptp.a tptp.a) 0)))) (not (not (not (>= (* tptp.a tptp.a) 0))))) :rule or_neg)
% 0.34/0.61  (step t272 (cl (or (not (>= (* tptp.a tptp.a) 1)) (not (not (>= (* tptp.a tptp.a) 0)))) (or (not (>= (* tptp.a tptp.a) 1)) (not (not (>= (* tptp.a tptp.a) 0))))) :rule resolution :premises (t269 t270 t271))
% 0.34/0.61  (step t273 (cl (or (not (>= (* tptp.a tptp.a) 1)) (not (not (>= (* tptp.a tptp.a) 0))))) :rule contraction :premises (t272))
% 0.34/0.61  (step t274 (cl (or (not (>= (* tptp.a tptp.a) 1)) (>= (* tptp.a tptp.a) 0))) :rule resolution :premises (t229 t232 t273))
% 0.34/0.61  (step t275 (cl (not (>= (* tptp.a tptp.a) 1)) (>= (* tptp.a tptp.a) 0)) :rule or :premises (t274))
% 0.34/0.61  (step t276 (cl (not (= (=> (and (ite (>= tptp.a 0) (ite (>= 1 0) (> tptp.a 1) (> tptp.a (- 1))) (ite (>= 1 0) (> (- tptp.a) 1) (> (- tptp.a) (- 1)))) (ite (>= tptp.a 0) (ite (>= 1 0) (> tptp.a 1) (> tptp.a (- 1))) (ite (>= 1 0) (> (- tptp.a) 1) (> (- tptp.a) (- 1)))) (not (= tptp.a 0))) (ite (>= (* tptp.a tptp.a) 0) (ite (>= 1 0) (> (* tptp.a tptp.a) 1) (> (* tptp.a tptp.a) (- 1))) (ite (>= 1 0) (> (- (* tptp.a tptp.a)) 1) (> (- (* tptp.a tptp.a)) (- 1))))) (=> (and (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1)))) (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1)))) (not (= tptp.a 0))) (ite (>= (* tptp.a tptp.a) 0) (>= (* tptp.a tptp.a) 2) (not (>= (* tptp.a tptp.a) (- 1))))))) (not (=> (and (ite (>= tptp.a 0) (ite (>= 1 0) (> tptp.a 1) (> tptp.a (- 1))) (ite (>= 1 0) (> (- tptp.a) 1) (> (- tptp.a) (- 1)))) (ite (>= tptp.a 0) (ite (>= 1 0) (> tptp.a 1) (> tptp.a (- 1))) (ite (>= 1 0) (> (- tptp.a) 1) (> (- tptp.a) (- 1)))) (not (= tptp.a 0))) (ite (>= (* tptp.a tptp.a) 0) (ite (>= 1 0) (> (* tptp.a tptp.a) 1) (> (* tptp.a tptp.a) (- 1))) (ite (>= 1 0) (> (- (* tptp.a tptp.a)) 1) (> (- (* tptp.a tptp.a)) (- 1)))))) (=> (and (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1)))) (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1)))) (not (= tptp.a 0))) (ite (>= (* tptp.a tptp.a) 0) (>= (* tptp.a tptp.a) 2) (not (>= (* tptp.a tptp.a) (- 1)))))) :rule equiv_pos2)
% 0.34/0.61  (step t277 (cl (= (>= 1 0) true)) :rule all_simplify)
% 0.34/0.61  (step t278 (cl (= (> tptp.a 1) (not (<= tptp.a 1)))) :rule all_simplify)
% 0.34/0.61  (step t279 (cl (= (not (<= tptp.a 1)) (not (not (>= tptp.a 2))))) :rule cong :premises (t153))
% 0.34/0.61  (step t280 (cl (= (not (<= tptp.a 1)) (>= tptp.a 2))) :rule trans :premises (t279 t79))
% 0.34/0.61  (step t281 (cl (= (> tptp.a 1) (>= tptp.a 2))) :rule trans :premises (t278 t280))
% 0.34/0.61  (step t282 (cl (= (> tptp.a (- 1)) (not (<= tptp.a (- 1))))) :rule all_simplify)
% 0.34/0.61  (step t283 (cl (= (- 1) (- 1))) :rule all_simplify)
% 0.34/0.61  (step t284 (cl (= (<= tptp.a (- 1)) (<= tptp.a (- 1)))) :rule cong :premises (t146 t283))
% 0.34/0.61  (step t285 (cl (= (<= tptp.a (- 1)) (not (>= tptp.a 0)))) :rule all_simplify)
% 0.34/0.61  (step t286 (cl (= (<= tptp.a (- 1)) (not (>= tptp.a 0)))) :rule trans :premises (t284 t285))
% 0.34/0.61  (step t287 (cl (= (not (<= tptp.a (- 1))) (not (not (>= tptp.a 0))))) :rule cong :premises (t286))
% 0.34/0.61  (step t288 (cl (= (not (<= tptp.a (- 1))) (>= tptp.a 0))) :rule trans :premises (t287 t6))
% 0.34/0.61  (step t289 (cl (= (> tptp.a (- 1)) (>= tptp.a 0))) :rule trans :premises (t282 t288))
% 0.34/0.61  (step t290 (cl (= (ite (>= 1 0) (> tptp.a 1) (> tptp.a (- 1))) (ite true (>= tptp.a 2) (>= tptp.a 0)))) :rule cong :premises (t277 t281 t289))
% 0.34/0.61  (step t291 (cl (= (ite true (>= tptp.a 2) (>= tptp.a 0)) (>= tptp.a 2))) :rule all_simplify)
% 0.34/0.61  (step t292 (cl (= (ite (>= 1 0) (> tptp.a 1) (> tptp.a (- 1))) (>= tptp.a 2))) :rule trans :premises (t290 t291))
% 0.34/0.61  (step t293 (cl (= (> (- tptp.a) 1) (not (<= (- tptp.a) 1)))) :rule all_simplify)
% 0.34/0.61  (step t294 (cl (= (- tptp.a) (* (- 1) tptp.a))) :rule all_simplify)
% 0.34/0.61  (step t295 (cl (= 1 1)) :rule refl)
% 0.34/0.61  (step t296 (cl (= (<= (- tptp.a) 1) (<= (* (- 1) tptp.a) 1))) :rule cong :premises (t294 t295))
% 0.34/0.61  (step t297 (cl (= (<= (* (- 1) tptp.a) 1) (>= tptp.a (- 1)))) :rule all_simplify)
% 0.34/0.61  (step t298 (cl (= (<= (- tptp.a) 1) (>= tptp.a (- 1)))) :rule trans :premises (t296 t297))
% 0.34/0.61  (step t299 (cl (= (not (<= (- tptp.a) 1)) (not (>= tptp.a (- 1))))) :rule cong :premises (t298))
% 0.34/0.61  (step t300 (cl (= (> (- tptp.a) 1) (not (>= tptp.a (- 1))))) :rule trans :premises (t293 t299))
% 0.34/0.61  (step t301 (cl (= (> (- tptp.a) (- 1)) (not (<= (- tptp.a) (- 1))))) :rule all_simplify)
% 0.34/0.61  (step t302 (cl (= (<= (- tptp.a) (- 1)) (<= (* (- 1) tptp.a) (- 1)))) :rule cong :premises (t294 t283))
% 0.34/0.61  (step t303 (cl (= (<= (* (- 1) tptp.a) (- 1)) (>= tptp.a 1))) :rule all_simplify)
% 0.34/0.61  (step t304 (cl (= (<= (- tptp.a) (- 1)) (>= tptp.a 1))) :rule trans :premises (t302 t303))
% 0.34/0.61  (step t305 (cl (= (not (<= (- tptp.a) (- 1))) (not (>= tptp.a 1)))) :rule cong :premises (t304))
% 0.34/0.61  (step t306 (cl (= (> (- tptp.a) (- 1)) (not (>= tptp.a 1)))) :rule trans :premises (t301 t305))
% 0.34/0.61  (step t307 (cl (= (ite (>= 1 0) (> (- tptp.a) 1) (> (- tptp.a) (- 1))) (ite true (not (>= tptp.a (- 1))) (not (>= tptp.a 1))))) :rule cong :premises (t277 t300 t306))
% 0.34/0.61  (step t308 (cl (= (ite true (not (>= tptp.a (- 1))) (not (>= tptp.a 1))) (not (>= tptp.a (- 1))))) :rule all_simplify)
% 0.34/0.61  (step t309 (cl (= (ite (>= 1 0) (> (- tptp.a) 1) (> (- tptp.a) (- 1))) (not (>= tptp.a (- 1))))) :rule trans :premises (t307 t308))
% 0.34/0.61  (step t310 (cl (= (ite (>= tptp.a 0) (ite (>= 1 0) (> tptp.a 1) (> tptp.a (- 1))) (ite (>= 1 0) (> (- tptp.a) 1) (> (- tptp.a) (- 1)))) (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1)))))) :rule cong :premises (t5 t292 t309))
% 0.34/0.61  (step t311 (cl (= (not (= tptp.a 0)) (not (= tptp.a 0)))) :rule refl)
% 0.34/0.61  (step t312 (cl (= (and (ite (>= tptp.a 0) (ite (>= 1 0) (> tptp.a 1) (> tptp.a (- 1))) (ite (>= 1 0) (> (- tptp.a) 1) (> (- tptp.a) (- 1)))) (ite (>= tptp.a 0) (ite (>= 1 0) (> tptp.a 1) (> tptp.a (- 1))) (ite (>= 1 0) (> (- tptp.a) 1) (> (- tptp.a) (- 1)))) (not (= tptp.a 0))) (and (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1)))) (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1)))) (not (= tptp.a 0))))) :rule cong :premises (t310 t310 t311))
% 0.34/0.61  (step t313 (cl (= (>= (* tptp.a tptp.a) 0) (>= (* tptp.a tptp.a) 0))) :rule refl)
% 0.34/0.61  (step t314 (cl (= (> (* tptp.a tptp.a) 1) (not (<= (* tptp.a tptp.a) 1)))) :rule all_simplify)
% 0.34/0.61  (step t315 (cl (= (<= (* tptp.a tptp.a) 1) (not (>= (* tptp.a tptp.a) 2)))) :rule all_simplify)
% 0.34/0.61  (step t316 (cl (= (not (<= (* tptp.a tptp.a) 1)) (not (not (>= (* tptp.a tptp.a) 2))))) :rule cong :premises (t315))
% 0.34/0.61  (step t317 (cl (= (not (not (>= (* tptp.a tptp.a) 2))) (>= (* tptp.a tptp.a) 2))) :rule all_simplify)
% 0.34/0.61  (step t318 (cl (= (not (<= (* tptp.a tptp.a) 1)) (>= (* tptp.a tptp.a) 2))) :rule trans :premises (t316 t317))
% 0.34/0.61  (step t319 (cl (= (> (* tptp.a tptp.a) 1) (>= (* tptp.a tptp.a) 2))) :rule trans :premises (t314 t318))
% 0.34/0.61  (step t320 (cl (= (> (* tptp.a tptp.a) (- 1)) (not (<= (* tptp.a tptp.a) (- 1))))) :rule all_simplify)
% 0.34/0.61  (step t321 (cl (= (* tptp.a tptp.a) (* tptp.a tptp.a))) :rule refl)
% 0.34/0.61  (step t322 (cl (= (<= (* tptp.a tptp.a) (- 1)) (<= (* tptp.a tptp.a) (- 1)))) :rule cong :premises (t321 t283))
% 0.34/0.61  (step t323 (cl (= (<= (* tptp.a tptp.a) (- 1)) (not (>= (* tptp.a tptp.a) 0)))) :rule all_simplify)
% 0.34/0.61  (step t324 (cl (= (<= (* tptp.a tptp.a) (- 1)) (not (>= (* tptp.a tptp.a) 0)))) :rule trans :premises (t322 t323))
% 0.34/0.61  (step t325 (cl (= (not (<= (* tptp.a tptp.a) (- 1))) (not (not (>= (* tptp.a tptp.a) 0))))) :rule cong :premises (t324))
% 0.34/0.61  (step t326 (cl (= (not (not (>= (* tptp.a tptp.a) 0))) (>= (* tptp.a tptp.a) 0))) :rule all_simplify)
% 0.34/0.61  (step t327 (cl (= (not (<= (* tptp.a tptp.a) (- 1))) (>= (* tptp.a tptp.a) 0))) :rule trans :premises (t325 t326))
% 0.34/0.61  (step t328 (cl (= (> (* tptp.a tptp.a) (- 1)) (>= (* tptp.a tptp.a) 0))) :rule trans :premises (t320 t327))
% 0.34/0.61  (step t329 (cl (= (ite (>= 1 0) (> (* tptp.a tptp.a) 1) (> (* tptp.a tptp.a) (- 1))) (ite true (>= (* tptp.a tptp.a) 2) (>= (* tptp.a tptp.a) 0)))) :rule cong :premises (t277 t319 t328))
% 0.34/0.61  (step t330 (cl (= (ite true (>= (* tptp.a tptp.a) 2) (>= (* tptp.a tptp.a) 0)) (>= (* tptp.a tptp.a) 2))) :rule all_simplify)
% 0.34/0.61  (step t331 (cl (= (ite (>= 1 0) (> (* tptp.a tptp.a) 1) (> (* tptp.a tptp.a) (- 1))) (>= (* tptp.a tptp.a) 2))) :rule trans :premises (t329 t330))
% 0.34/0.61  (step t332 (cl (= (> (- (* tptp.a tptp.a)) 1) (not (<= (- (* tptp.a tptp.a)) 1)))) :rule all_simplify)
% 0.34/0.61  (step t333 (cl (= (- (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a)))) :rule all_simplify)
% 0.34/0.61  (step t334 (cl (= (<= (- (* tptp.a tptp.a)) 1) (<= (* (- 1) (* tptp.a tptp.a)) 1))) :rule cong :premises (t333 t295))
% 0.34/0.61  (step t335 (cl (= (<= (* (- 1) (* tptp.a tptp.a)) 1) (>= (* tptp.a tptp.a) (- 1)))) :rule all_simplify)
% 0.34/0.61  (step t336 (cl (= (<= (- (* tptp.a tptp.a)) 1) (>= (* tptp.a tptp.a) (- 1)))) :rule trans :premises (t334 t335))
% 0.34/0.61  (step t337 (cl (= (not (<= (- (* tptp.a tptp.a)) 1)) (not (>= (* tptp.a tptp.a) (- 1))))) :rule cong :premises (t336))
% 0.34/0.61  (step t338 (cl (= (> (- (* tptp.a tptp.a)) 1) (not (>= (* tptp.a tptp.a) (- 1))))) :rule trans :premises (t332 t337))
% 0.34/0.61  (step t339 (cl (= (> (- (* tptp.a tptp.a)) (- 1)) (not (<= (- (* tptp.a tptp.a)) (- 1))))) :rule all_simplify)
% 0.34/0.61  (step t340 (cl (= (<= (- (* tptp.a tptp.a)) (- 1)) (<= (* (- 1) (* tptp.a tptp.a)) (- 1)))) :rule cong :premises (t333 t283))
% 0.34/0.61  (step t341 (cl (= (<= (* (- 1) (* tptp.a tptp.a)) (- 1)) (>= (* tptp.a tptp.a) 1))) :rule all_simplify)
% 0.34/0.61  (step t342 (cl (= (<= (- (* tptp.a tptp.a)) (- 1)) (>= (* tptp.a tptp.a) 1))) :rule trans :premises (t340 t341))
% 0.34/0.61  (step t343 (cl (= (not (<= (- (* tptp.a tptp.a)) (- 1))) (not (>= (* tptp.a tptp.a) 1)))) :rule cong :premises (t342))
% 0.34/0.61  (step t344 (cl (= (> (- (* tptp.a tptp.a)) (- 1)) (not (>= (* tptp.a tptp.a) 1)))) :rule trans :premises (t339 t343))
% 0.34/0.61  (step t345 (cl (= (ite (>= 1 0) (> (- (* tptp.a tptp.a)) 1) (> (- (* tptp.a tptp.a)) (- 1))) (ite true (not (>= (* tptp.a tptp.a) (- 1))) (not (>= (* tptp.a tptp.a) 1))))) :rule cong :premises (t277 t338 t344))
% 0.34/0.61  (step t346 (cl (= (ite true (not (>= (* tptp.a tptp.a) (- 1))) (not (>= (* tptp.a tptp.a) 1))) (not (>= (* tptp.a tptp.a) (- 1))))) :rule all_simplify)
% 0.34/0.61  (step t347 (cl (= (ite (>= 1 0) (> (- (* tptp.a tptp.a)) 1) (> (- (* tptp.a tptp.a)) (- 1))) (not (>= (* tptp.a tptp.a) (- 1))))) :rule trans :premises (t345 t346))
% 0.34/0.61  (step t348 (cl (= (ite (>= (* tptp.a tptp.a) 0) (ite (>= 1 0) (> (* tptp.a tptp.a) 1) (> (* tptp.a tptp.a) (- 1))) (ite (>= 1 0) (> (- (* tptp.a tptp.a)) 1) (> (- (* tptp.a tptp.a)) (- 1)))) (ite (>= (* tptp.a tptp.a) 0) (>= (* tptp.a tptp.a) 2) (not (>= (* tptp.a tptp.a) (- 1)))))) :rule cong :premises (t313 t331 t347))
% 0.34/0.61  (step t349 (cl (= (=> (and (ite (>= tptp.a 0) (ite (>= 1 0) (> tptp.a 1) (> tptp.a (- 1))) (ite (>= 1 0) (> (- tptp.a) 1) (> (- tptp.a) (- 1)))) (ite (>= tptp.a 0) (ite (>= 1 0) (> tptp.a 1) (> tptp.a (- 1))) (ite (>= 1 0) (> (- tptp.a) 1) (> (- tptp.a) (- 1)))) (not (= tptp.a 0))) (ite (>= (* tptp.a tptp.a) 0) (ite (>= 1 0) (> (* tptp.a tptp.a) 1) (> (* tptp.a tptp.a) (- 1))) (ite (>= 1 0) (> (- (* tptp.a tptp.a)) 1) (> (- (* tptp.a tptp.a)) (- 1))))) (=> (and (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1)))) (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1)))) (not (= tptp.a 0))) (ite (>= (* tptp.a tptp.a) 0) (>= (* tptp.a tptp.a) 2) (not (>= (* tptp.a tptp.a) (- 1))))))) :rule cong :premises (t312 t348))
% 0.34/0.61  (step t350 (cl (=> (and (ite (>= tptp.a 0) (ite (>= 1 0) (> tptp.a 1) (> tptp.a (- 1))) (ite (>= 1 0) (> (- tptp.a) 1) (> (- tptp.a) (- 1)))) (ite (>= tptp.a 0) (ite (>= 1 0) (> tptp.a 1) (> tptp.a (- 1))) (ite (>= 1 0) (> (- tptp.a) 1) (> (- tptp.a) (- 1)))) (not (= tptp.a 0))) (ite (>= (* tptp.a tptp.a) 0) (ite (>= 1 0) (> (* tptp.a tptp.a) 1) (> (* tptp.a tptp.a) (- 1))) (ite (>= 1 0) (> (- (* tptp.a tptp.a)) 1) (> (- (* tptp.a tptp.a)) (- 1)))))) :rule hole :args ((=> (and (ite (>= tptp.a 0) (ite (>= 1 0) (> tptp.a 1) (> tptp.a (- 1))) (ite (>= 1 0) (> (- tptp.a) 1) (> (- tptp.a) (- 1)))) (ite (>= tptp.a 0) (ite (>= 1 0) (> tptp.a 1) (> tptp.a (- 1))) (ite (>= 1 0) (> (- tptp.a) 1) (> (- tptp.a) (- 1)))) (not (= tptp.a 0))) (ite (>= (* tptp.a tptp.a) 0) (ite (>= 1 0) (> (* tptp.a tptp.a) 1) (> (* tptp.a tptp.a) (- 1))) (ite (>= 1 0) (> (- (* tptp.a tptp.a)) 1) (> (- (* tptp.a tptp.a)) (- 1))))) 3))
% 0.34/0.61  (step t351 (cl (=> (and (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1)))) (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1)))) (not (= tptp.a 0))) (ite (>= (* tptp.a tptp.a) 0) (>= (* tptp.a tptp.a) 2) (not (>= (* tptp.a tptp.a) (- 1)))))) :rule resolution :premises (t276 t349 t350))
% 0.34/0.61  (step t352 (cl (not (and (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1)))) (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1)))) (not (= tptp.a 0)))) (ite (>= (* tptp.a tptp.a) 0) (>= (* tptp.a tptp.a) 2) (not (>= (* tptp.a tptp.a) (- 1))))) :rule implies :premises (t351))
% 0.34/0.61  (step t353 (cl (not (= (=> (and (> (* tptp.a tptp.a) 0) (>= tptp.a 2)) (>= (* (* tptp.a tptp.a) tptp.a) (* (* tptp.a tptp.a) (* (- 1) (- 2))))) (=> (and (>= (* tptp.a tptp.a) 1) (>= tptp.a 2)) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1))))) (not (=> (and (> (* tptp.a tptp.a) 0) (>= tptp.a 2)) (>= (* (* tptp.a tptp.a) tptp.a) (* (* tptp.a tptp.a) (* (- 1) (- 2)))))) (=> (and (>= (* tptp.a tptp.a) 1) (>= tptp.a 2)) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)))) :rule equiv_pos2)
% 0.34/0.61  (step t354 (cl (= (> (* tptp.a tptp.a) 0) (not (<= (* tptp.a tptp.a) 0)))) :rule all_simplify)
% 0.34/0.61  (step t355 (cl (= 0 0)) :rule refl)
% 0.34/0.61  (step t356 (cl (= (<= (* tptp.a tptp.a) 0) (<= (* tptp.a tptp.a) 0))) :rule cong :premises (t145 t355))
% 0.34/0.61  (step t357 (cl (= (<= (* tptp.a tptp.a) 0) (not (>= (* tptp.a tptp.a) 1)))) :rule all_simplify)
% 0.34/0.61  (step t358 (cl (= (<= (* tptp.a tptp.a) 0) (not (>= (* tptp.a tptp.a) 1)))) :rule trans :premises (t356 t357))
% 0.34/0.61  (step t359 (cl (= (not (<= (* tptp.a tptp.a) 0)) (not (not (>= (* tptp.a tptp.a) 1))))) :rule cong :premises (t358))
% 0.34/0.61  (step t360 (cl (= (not (not (>= (* tptp.a tptp.a) 1))) (>= (* tptp.a tptp.a) 1))) :rule all_simplify)
% 0.34/0.61  (step t361 (cl (= (not (<= (* tptp.a tptp.a) 0)) (>= (* tptp.a tptp.a) 1))) :rule trans :premises (t359 t360))
% 0.34/0.61  (step t362 (cl (= (> (* tptp.a tptp.a) 0) (>= (* tptp.a tptp.a) 1))) :rule trans :premises (t354 t361))
% 0.34/0.61  (step t363 (cl (= (and (> (* tptp.a tptp.a) 0) (>= tptp.a 2)) (and (>= (* tptp.a tptp.a) 1) (>= tptp.a 2)))) :rule cong :premises (t362 t78))
% 0.34/0.61  (step t364 (cl (= (* (- 1) (- 2)) 2)) :rule all_simplify)
% 0.34/0.61  (step t365 (cl (= (* (* tptp.a tptp.a) (* (- 1) (- 2))) (* (* tptp.a tptp.a) 2))) :rule cong :premises (t145 t364))
% 0.34/0.61  (step t366 (cl (= (* (* tptp.a tptp.a) 2) (* 2 (* tptp.a tptp.a)))) :rule all_simplify)
% 0.34/0.61  (step t367 (cl (= (* (* tptp.a tptp.a) (* (- 1) (- 2))) (* 2 (* tptp.a tptp.a)))) :rule trans :premises (t365 t366))
% 0.34/0.61  (step t368 (cl (= (>= (* (* tptp.a tptp.a) tptp.a) (* (* tptp.a tptp.a) (* (- 1) (- 2)))) (>= (* tptp.a tptp.a tptp.a) (* 2 (* tptp.a tptp.a))))) :rule cong :premises (t149 t367))
% 0.34/0.61  (step t369 (cl (= (>= (* tptp.a tptp.a tptp.a) (* 2 (* tptp.a tptp.a))) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)))) :rule all_simplify)
% 0.34/0.61  (step t370 (cl (= (>= (* (* tptp.a tptp.a) tptp.a) (* (* tptp.a tptp.a) (* (- 1) (- 2)))) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)))) :rule trans :premises (t368 t369))
% 0.34/0.61  (step t371 (cl (= (=> (and (> (* tptp.a tptp.a) 0) (>= tptp.a 2)) (>= (* (* tptp.a tptp.a) tptp.a) (* (* tptp.a tptp.a) (* (- 1) (- 2))))) (=> (and (>= (* tptp.a tptp.a) 1) (>= tptp.a 2)) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1))))) :rule cong :premises (t363 t370))
% 0.34/0.61  (step t372 (cl (not (= (=> (and (> (* tptp.a tptp.a) 0) (>= tptp.a (* (- 1) (- 2)))) (>= (* (* tptp.a tptp.a) tptp.a) (* (* tptp.a tptp.a) (* (- 1) (- 2))))) (=> (and (> (* tptp.a tptp.a) 0) (>= tptp.a 2)) (>= (* (* tptp.a tptp.a) tptp.a) (* (* tptp.a tptp.a) (* (- 1) (- 2))))))) (not (=> (and (> (* tptp.a tptp.a) 0) (>= tptp.a (* (- 1) (- 2)))) (>= (* (* tptp.a tptp.a) tptp.a) (* (* tptp.a tptp.a) (* (- 1) (- 2)))))) (=> (and (> (* tptp.a tptp.a) 0) (>= tptp.a 2)) (>= (* (* tptp.a tptp.a) tptp.a) (* (* tptp.a tptp.a) (* (- 1) (- 2)))))) :rule equiv_pos2)
% 0.34/0.61  (step t373 (cl (= (>= tptp.a (* (- 1) (- 2))) (>= tptp.a 2))) :rule cong :premises (t146 t364))
% 0.34/0.61  (step t374 (cl (= (and (> (* tptp.a tptp.a) 0) (>= tptp.a (* (- 1) (- 2)))) (and (>= (* tptp.a tptp.a) 1) (>= tptp.a 2)))) :rule cong :premises (t362 t373))
% 0.34/0.61  (step t375 (cl (= (=> (and (> (* tptp.a tptp.a) 0) (>= tptp.a (* (- 1) (- 2)))) (>= (* (* tptp.a tptp.a) tptp.a) (* (* tptp.a tptp.a) (* (- 1) (- 2))))) (=> (and (>= (* tptp.a tptp.a) 1) (>= tptp.a 2)) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1))))) :rule cong :premises (t374 t370))
% 0.34/0.61  (step t376 (cl (= (=> (and (> (* tptp.a tptp.a) 0) (>= tptp.a 2)) (>= (* (* tptp.a tptp.a) tptp.a) (* (* tptp.a tptp.a) (* (- 1) (- 2))))) (=> (and (>= (* tptp.a tptp.a) 1) (>= tptp.a 2)) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1))))) :rule cong :premises (t363 t370))
% 0.34/0.61  (step t377 (cl (= (=> (and (>= (* tptp.a tptp.a) 1) (>= tptp.a 2)) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1))) (=> (and (> (* tptp.a tptp.a) 0) (>= tptp.a 2)) (>= (* (* tptp.a tptp.a) tptp.a) (* (* tptp.a tptp.a) (* (- 1) (- 2))))))) :rule symm :premises (t376))
% 0.34/0.61  (step t378 (cl (= (=> (and (> (* tptp.a tptp.a) 0) (>= tptp.a (* (- 1) (- 2)))) (>= (* (* tptp.a tptp.a) tptp.a) (* (* tptp.a tptp.a) (* (- 1) (- 2))))) (=> (and (> (* tptp.a tptp.a) 0) (>= tptp.a 2)) (>= (* (* tptp.a tptp.a) tptp.a) (* (* tptp.a tptp.a) (* (- 1) (- 2))))))) :rule trans :premises (t375 t377))
% 0.34/0.61  (step t379 (cl (=> (and (> (* tptp.a tptp.a) 0) (>= tptp.a (* (- 1) (- 2)))) (>= (* (* tptp.a tptp.a) tptp.a) (* (* tptp.a tptp.a) (* (- 1) (- 2)))))) :rule la_mult_pos)
% 0.34/0.61  (step t380 (cl (=> (and (> (* tptp.a tptp.a) 0) (>= tptp.a 2)) (>= (* (* tptp.a tptp.a) tptp.a) (* (* tptp.a tptp.a) (* (- 1) (- 2)))))) :rule resolution :premises (t372 t378 t379))
% 0.34/0.61  (step t381 (cl (=> (and (>= (* tptp.a tptp.a) 1) (>= tptp.a 2)) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)))) :rule resolution :premises (t353 t371 t380))
% 0.34/0.61  (step t382 (cl (not (and (>= (* tptp.a tptp.a) 1) (>= tptp.a 2))) (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1))) :rule implies :premises (t381))
% 0.34/0.61  (step t383 (cl (not (>= (+ (* 2 (* tptp.a tptp.a)) (* (- 1) (* tptp.a tptp.a tptp.a))) 1)) (not (and (>= (* tptp.a tptp.a) 1) (>= tptp.a 2)))) :rule reordering :premises (t382))
% 0.34/0.61  (step t384 (cl (and (>= (* tptp.a tptp.a) 1) (>= tptp.a 2)) (not (>= (* tptp.a tptp.a) 1)) (not (>= tptp.a 2))) :rule and_neg)
% 0.34/0.61  (step t385 (cl (not (>= tptp.a 2)) (not (>= (* tptp.a tptp.a) 1)) (and (>= (* tptp.a tptp.a) 1) (>= tptp.a 2))) :rule reordering :premises (t384))
% 0.34/0.61  (step t386 (cl (>= (* tptp.a tptp.a tptp.a) 4) (not (>= (* tptp.a tptp.a) 1)) (not (and (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1)))) (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1)))) (not (= tptp.a 0)))) (not (>= tptp.a 2)) (not (>= (* tptp.a tptp.a) 1))) :rule resolution :premises (t226 t228 t275 t352 t383 t385))
% 0.34/0.61  (step t387 (cl (>= (* tptp.a tptp.a tptp.a) 4) (not (>= (* tptp.a tptp.a) 1)) (not (and (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1)))) (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1)))) (not (= tptp.a 0)))) (not (>= tptp.a 2))) :rule contraction :premises (t386))
% 0.34/0.61  (step t388 (cl (not (= (or (not (not (= tptp.a 0))) (>= (* tptp.a tptp.a) 1)) (or (= tptp.a 0) (>= (* tptp.a tptp.a) 1)))) (not (or (not (not (= tptp.a 0))) (>= (* tptp.a tptp.a) 1))) (or (= tptp.a 0) (>= (* tptp.a tptp.a) 1))) :rule equiv_pos2)
% 0.34/0.61  (step t389 (cl (= (>= (* tptp.a tptp.a) 1) (>= (* tptp.a tptp.a) 1))) :rule refl)
% 0.34/0.61  (step t390 (cl (= (or (not (not (= tptp.a 0))) (>= (* tptp.a tptp.a) 1)) (or (= tptp.a 0) (>= (* tptp.a tptp.a) 1)))) :rule cong :premises (t50 t389))
% 0.34/0.61  (step t391 (cl (not (= (=> (not (= tptp.a 0)) (> (* tptp.a tptp.a) 0)) (=> (not (= tptp.a 0)) (>= (* tptp.a tptp.a) 1)))) (not (=> (not (= tptp.a 0)) (> (* tptp.a tptp.a) 0))) (=> (not (= tptp.a 0)) (>= (* tptp.a tptp.a) 1))) :rule equiv_pos2)
% 0.34/0.61  (step t392 (cl (= (> (* tptp.a tptp.a) 0) (not (<= (* tptp.a tptp.a) 0)))) :rule all_simplify)
% 0.34/0.61  (step t393 (cl (= (not (<= (* tptp.a tptp.a) 0)) (not (not (>= (* tptp.a tptp.a) 1))))) :rule cong :premises (t357))
% 0.34/0.61  (step t394 (cl (= (not (<= (* tptp.a tptp.a) 0)) (>= (* tptp.a tptp.a) 1))) :rule trans :premises (t393 t360))
% 0.34/0.61  (step t395 (cl (= (> (* tptp.a tptp.a) 0) (>= (* tptp.a tptp.a) 1))) :rule trans :premises (t392 t394))
% 0.34/0.61  (step t396 (cl (= (=> (not (= tptp.a 0)) (> (* tptp.a tptp.a) 0)) (=> (not (= tptp.a 0)) (>= (* tptp.a tptp.a) 1)))) :rule cong :premises (t311 t395))
% 0.34/0.61  (step t397 (cl (=> (not (= tptp.a 0)) (> (* tptp.a tptp.a) 0))) :rule hole :args ((not (= tptp.a 0)) (* tptp.a tptp.a)))
% 0.34/0.61  (step t398 (cl (=> (not (= tptp.a 0)) (>= (* tptp.a tptp.a) 1))) :rule resolution :premises (t391 t396 t397))
% 0.34/0.61  (step t399 (cl (not (not (= tptp.a 0))) (>= (* tptp.a tptp.a) 1)) :rule implies :premises (t398))
% 0.34/0.61  (step t400 (cl (or (not (not (= tptp.a 0))) (>= (* tptp.a tptp.a) 1)) (not (not (not (= tptp.a 0))))) :rule or_neg)
% 0.34/0.61  (step t401 (cl (or (not (not (= tptp.a 0))) (>= (* tptp.a tptp.a) 1)) (not (>= (* tptp.a tptp.a) 1))) :rule or_neg)
% 0.34/0.61  (step t402 (cl (or (not (not (= tptp.a 0))) (>= (* tptp.a tptp.a) 1)) (or (not (not (= tptp.a 0))) (>= (* tptp.a tptp.a) 1))) :rule resolution :premises (t399 t400 t401))
% 0.34/0.61  (step t403 (cl (or (not (not (= tptp.a 0))) (>= (* tptp.a tptp.a) 1))) :rule contraction :premises (t402))
% 0.34/0.61  (step t404 (cl (or (= tptp.a 0) (>= (* tptp.a tptp.a) 1))) :rule resolution :premises (t388 t390 t403))
% 0.34/0.61  (step t405 (cl (= tptp.a 0) (>= (* tptp.a tptp.a) 1)) :rule or :premises (t404))
% 0.34/0.61  (step t406 (cl (not (= (or (and (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1)))) (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1)))) (not (= tptp.a 0))) (not (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1))))) (not (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1))))) (not (not (= tptp.a 0)))) (or (and (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1)))) (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1)))) (not (= tptp.a 0))) (not (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1))))) (not (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1))))) (= tptp.a 0)))) (not (or (and (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1)))) (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1)))) (not (= tptp.a 0))) (not (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1))))) (not (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1))))) (not (not (= tptp.a 0))))) (or (and (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1)))) (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1)))) (not (= tptp.a 0))) (not (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1))))) (not (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1))))) (= tptp.a 0))) :rule equiv_pos2)
% 0.34/0.61  (step t407 (cl (= (and (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1)))) (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1)))) (not (= tptp.a 0))) (and (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1)))) (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1)))) (not (= tptp.a 0))))) :rule refl)
% 0.34/0.61  (step t408 (cl (= (not (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1))))) (not (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1))))))) :rule refl)
% 0.34/0.61  (step t409 (cl (= (or (and (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1)))) (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1)))) (not (= tptp.a 0))) (not (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1))))) (not (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1))))) (not (not (= tptp.a 0)))) (or (and (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1)))) (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1)))) (not (= tptp.a 0))) (not (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1))))) (not (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1))))) (= tptp.a 0)))) :rule cong :premises (t407 t408 t408 t50))
% 0.34/0.61  (step t410 (cl (and (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1)))) (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1)))) (not (= tptp.a 0))) (not (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1))))) (not (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1))))) (not (not (= tptp.a 0)))) :rule and_neg)
% 0.34/0.61  (step t411 (cl (or (and (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1)))) (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1)))) (not (= tptp.a 0))) (not (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1))))) (not (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1))))) (not (not (= tptp.a 0)))) (not (and (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1)))) (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1)))) (not (= tptp.a 0))))) :rule or_neg)
% 0.34/0.61  (step t412 (cl (or (and (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1)))) (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1)))) (not (= tptp.a 0))) (not (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1))))) (not (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1))))) (not (not (= tptp.a 0)))) (not (not (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1))))))) :rule or_neg)
% 0.34/0.61  (step t413 (cl (or (and (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1)))) (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1)))) (not (= tptp.a 0))) (not (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1))))) (not (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1))))) (not (not (= tptp.a 0)))) (not (not (not (= tptp.a 0))))) :rule or_neg)
% 0.34/0.61  (step t414 (cl (or (and (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1)))) (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1)))) (not (= tptp.a 0))) (not (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1))))) (not (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1))))) (not (not (= tptp.a 0)))) (or (and (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1)))) (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1)))) (not (= tptp.a 0))) (not (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1))))) (not (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1))))) (not (not (= tptp.a 0)))) (or (and (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1)))) (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1)))) (not (= tptp.a 0))) (not (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1))))) (not (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1))))) (not (not (= tptp.a 0)))) (or (and (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1)))) (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1)))) (not (= tptp.a 0))) (not (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1))))) (not (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1))))) (not (not (= tptp.a 0))))) :rule resolution :premises (t410 t411 t412 t412 t413))
% 0.34/0.61  (step t415 (cl (or (and (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1)))) (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1)))) (not (= tptp.a 0))) (not (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1))))) (not (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1))))) (not (not (= tptp.a 0))))) :rule contraction :premises (t414))
% 0.34/0.61  (step t416 (cl (or (and (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1)))) (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1)))) (not (= tptp.a 0))) (not (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1))))) (not (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1))))) (= tptp.a 0))) :rule resolution :premises (t406 t409 t415))
% 0.34/0.61  (step t417 (cl (and (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1)))) (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1)))) (not (= tptp.a 0))) (not (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1))))) (not (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1))))) (= tptp.a 0)) :rule or :premises (t416))
% 0.34/0.61  (step t418 (cl (and (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1)))) (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1)))) (not (= tptp.a 0))) (not (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1))))) (= tptp.a 0)) :rule contraction :premises (t417))
% 0.34/0.61  (step t419 (cl (= tptp.a 0) (and (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1)))) (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1)))) (not (= tptp.a 0))) (not (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1)))))) :rule reordering :premises (t418))
% 0.34/0.61  (step t420 (cl (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1)))) (not (>= tptp.a 0)) (not (>= tptp.a 2))) :rule ite_neg2)
% 0.34/0.61  (step t421 (cl (not (>= tptp.a 2)) (not (>= tptp.a 0)) (ite (>= tptp.a 0) (>= tptp.a 2) (not (>= tptp.a (- 1))))) :rule reordering :premises (t420))
% 0.34/0.61  (step t422 (cl (>= (* tptp.a tptp.a tptp.a) 4) (not (>= tptp.a 2)) (= tptp.a 0) (= tptp.a 0) (not (>= tptp.a 2)) (not (>= tptp.a 0))) :rule resolution :premises (t387 t405 t419 t421))
% 0.34/0.61  (step t423 (cl (>= (* tptp.a tptp.a tptp.a) 4) (not (>= tptp.a 2)) (= tptp.a 0) (not (>= tptp.a 0))) :rule contraction :premises (t422))
% 0.34/0.61  (step t424 (cl (not (= (=> (and (>= tptp.a 2) (= tptp.a 0)) (and (= tptp.a 0) (>= tptp.a 2))) (not (and (>= tptp.a 2) (= tptp.a 0))))) (not (=> (and (>= tptp.a 2) (= tptp.a 0)) (and (= tptp.a 0) (>= tptp.a 2)))) (not (and (>= tptp.a 2) (= tptp.a 0)))) :rule equiv_pos2)
% 0.34/0.61  (step t425 (cl (= (and (>= tptp.a 2) (= tptp.a 0)) (and (>= tptp.a 2) (= tptp.a 0)))) :rule refl)
% 0.34/0.61  (step t426 (cl (= (= (and (= tptp.a 0) (>= tptp.a 2)) false) (not (and (= tptp.a 0) (>= tptp.a 2))))) :rule equiv_simplify)
% 0.34/0.61  (step t427 (cl (= (and (= tptp.a 0) (>= tptp.a 2)) false) (not (not (and (= tptp.a 0) (>= tptp.a 2))))) :rule equiv2 :premises (t426))
% 0.34/0.61  (step t428 (cl (not (not (not (and (= tptp.a 0) (>= tptp.a 2))))) (and (= tptp.a 0) (>= tptp.a 2))) :rule not_not)
% 0.34/0.61  (step t429 (cl (= (and (= tptp.a 0) (>= tptp.a 2)) false) (and (= tptp.a 0) (>= tptp.a 2))) :rule resolution :premises (t427 t428))
% 0.34/0.61  (step t430 (cl (=> (and (= tptp.a 0) (>= tptp.a 2)) false) (and (= tptp.a 0) (>= tptp.a 2))) :rule implies_neg1)
% 0.34/0.61  (anchor :step t431)
% 0.34/0.61  (assume t431.a0 (= tptp.a 0))
% 0.34/0.61  (assume t431.a1 (>= tptp.a 2))
% 0.34/0.61  (step t431.t1 (cl (=> (= tptp.a 0) false) (= tptp.a 0)) :rule implies_neg1)
% 0.34/0.61  (anchor :step t431.t2)
% 0.34/0.61  (assume t431.t2.a0 (= tptp.a 0))
% 0.34/0.61  (step t431.t2.t1 (cl (not (= (<= (+ (* 1.0 tptp.a) (* (- 1.0) tptp.a)) (+ (* 1.0 0) (* (- 1.0) 2))) false)) (not (<= (+ (* 1.0 tptp.a) (* (- 1.0) tptp.a)) (+ (* 1.0 0) (* (- 1.0) 2)))) false) :rule equiv_pos2)
% 0.34/0.61  (step t431.t2.t2 (cl (= (* 1.0 tptp.a) (to_real tptp.a))) :rule all_simplify)
% 0.34/0.61  (step t431.t2.t3 (cl (= (* (- 1.0) tptp.a) (to_real (* (- 1) tptp.a)))) :rule all_simplify)
% 0.34/0.61  (step t431.t2.t4 (cl (= (+ (* 1.0 tptp.a) (* (- 1.0) tptp.a)) (+ (to_real tptp.a) (to_real (* (- 1) tptp.a))))) :rule cong :premises (t431.t2.t2 t431.t2.t3))
% 0.34/0.61  (step t431.t2.t5 (cl (= (+ (to_real tptp.a) (to_real (* (- 1) tptp.a))) 0.0)) :rule all_simplify)
% 0.34/0.61  (step t431.t2.t6 (cl (= (+ (* 1.0 tptp.a) (* (- 1.0) tptp.a)) 0.0)) :rule trans :premises (t431.t2.t4 t431.t2.t5))
% 0.34/0.61  (step t431.t2.t7 (cl (= (* 1.0 0) 0.0)) :rule all_simplify)
% 0.34/0.61  (step t431.t2.t8 (cl (= (* (- 1.0) 2) (- 2.0))) :rule all_simplify)
% 0.34/0.61  (step t431.t2.t9 (cl (= (+ (* 1.0 0) (* (- 1.0) 2)) (+ 0.0 (- 2.0)))) :rule cong :premises (t431.t2.t7 t431.t2.t8))
% 0.34/0.61  (step t431.t2.t10 (cl (= (+ 0.0 (- 2.0)) (- 2.0))) :rule all_simplify)
% 0.34/0.61  (step t431.t2.t11 (cl (= (+ (* 1.0 0) (* (- 1.0) 2)) (- 2.0))) :rule trans :premises (t431.t2.t9 t431.t2.t10))
% 0.34/0.61  (step t431.t2.t12 (cl (= (<= (+ (* 1.0 tptp.a) (* (- 1.0) tptp.a)) (+ (* 1.0 0) (* (- 1.0) 2))) (<= 0.0 (- 2.0)))) :rule cong :premises (t431.t2.t6 t431.t2.t11))
% 0.34/0.61  (step t431.t2.t13 (cl (= (<= 0.0 (- 2.0)) false)) :rule all_simplify)
% 0.34/0.61  (step t431.t2.t14 (cl (= (<= (+ (* 1.0 tptp.a) (* (- 1.0) tptp.a)) (+ (* 1.0 0) (* (- 1.0) 2))) false)) :rule trans :premises (t431.t2.t12 t431.t2.t13))
% 0.34/0.61  (step t431.t2.t15 (cl (not (= (* 1.0 tptp.a) (* 1.0 0))) (not (<= (* (- 1.0) tptp.a) (* (- 1.0) 2))) (<= (+ (* 1.0 tptp.a) (* (- 1.0) tptp.a)) (+ (* 1.0 0) (* (- 1.0) 2)))) :rule la_generic :args ((- 1) 1 1))
% 0.34/0.61  (step t431.t2.t16 (cl (=> (and (> 1.0 0) (= tptp.a 0)) (= (* 1.0 tptp.a) (* 1.0 0)))) :rule la_mult_pos)
% 0.34/0.61  (step t431.t2.t17 (cl (not (and (> 1.0 0) (= tptp.a 0))) (= (* 1.0 tptp.a) (* 1.0 0))) :rule implies :premises (t431.t2.t16))
% 0.34/0.61  (step t431.t2.t18 (cl (and (> 1.0 0) (= tptp.a 0)) (not (> 1.0 0)) (not (= tptp.a 0))) :rule and_neg)
% 0.34/0.61  (step t431.t2.t19 (cl (= (= (> 1.0 0) true) (> 1.0 0))) :rule equiv_simplify)
% 0.34/0.61  (step t431.t2.t20 (cl (not (= (> 1.0 0) true)) (> 1.0 0)) :rule equiv1 :premises (t431.t2.t19))
% 0.34/0.61  (step t431.t2.t21 (cl (= (> 1.0 0) true)) :rule hole :args ((> 1.0 0)))
% 0.34/0.61  (step t431.t2.t22 (cl (> 1.0 0)) :rule resolution :premises (t431.t2.t20 t431.t2.t21))
% 0.34/0.61  (step t431.t2.t23 (cl (and (> 1.0 0) (= tptp.a 0))) :rule resolution :premises (t431.t2.t18 t431.t2.t22 t431.t2.a0))
% 0.34/0.61  (step t431.t2.t24 (cl (= (* 1.0 tptp.a) (* 1.0 0))) :rule resolution :premises (t431.t2.t17 t431.t2.t23))
% 0.34/0.61  (step t431.t2.t25 (cl (=> (and (< (- 1.0) 0) (>= tptp.a 2)) (<= (* (- 1.0) tptp.a) (* (- 1.0) 2)))) :rule la_mult_neg)
% 0.34/0.61  (step t431.t2.t26 (cl (not (and (< (- 1.0) 0) (>= tptp.a 2))) (<= (* (- 1.0) tptp.a) (* (- 1.0) 2))) :rule implies :premises (t431.t2.t25))
% 0.34/0.61  (step t431.t2.t27 (cl (and (< (- 1.0) 0) (>= tptp.a 2)) (not (< (- 1.0) 0)) (not (>= tptp.a 2))) :rule and_neg)
% 0.34/0.61  (step t431.t2.t28 (cl (= (= (< (- 1.0) 0) true) (< (- 1.0) 0))) :rule equiv_simplify)
% 0.34/0.61  (step t431.t2.t29 (cl (not (= (< (- 1.0) 0) true)) (< (- 1.0) 0)) :rule equiv1 :premises (t431.t2.t28))
% 0.34/0.61  (step t431.t2.t30 (cl (= (< (- 1.0) 0) true)) :rule hole :args ((< (- 1.0) 0)))
% 0.34/0.61  (step t431.t2.t31 (cl (< (- 1.0) 0)) :rule resolution :premises (t431.t2.t29 t431.t2.t30))
% 0.34/0.61  (step t431.t2.t32 (cl (and (< (- 1.0) 0) (>= tptp.a 2))) :rule resolution :premises (t431.t2.t27 t431.t2.t31 t431.a1))
% 0.34/0.61  (step t431.t2.t33 (cl (<= (* (- 1.0) tptp.a) (* (- 1.0) 2))) :rule resolution :premises (t431.t2.t26 t431.t2.t32))
% 0.34/0.61  (step t431.t2.t34 (cl (<= (+ (* 1.0 tptp.a) (* (- 1.0) tptp.a)) (+ (* 1.0 0) (* (- 1.0) 2)))) :rule resolution :premises (t431.t2.t15 t431.t2.t24 t431.t2.t33))
% 0.34/0.61  (step t431.t2.t35 (cl false) :rule resolution :premises (t431.t2.t1 t431.t2.t14 t431.t2.t34))
% 0.34/0.61  (step t431.t2 (cl (not (= tptp.a 0)) false) :rule subproof :discharge (t431.t2.a0))
% 0.34/0.61  (step t431.t3 (cl (=> (= tptp.a 0) false) false) :rule resolution :premises (t431.t1 t431.t2))
% 0.34/0.61  (step t431.t4 (cl (=> (= tptp.a 0) false) (not false)) :rule implies_neg2)
% 0.34/0.61  (step t431.t5 (cl (=> (= tptp.a 0) false) (=> (= tptp.a 0) false)) :rule resolution :premises (t431.t3 t431.t4))
% 0.34/0.61  (step t431.t6 (cl (=> (= tptp.a 0) false)) :rule contraction :premises (t431.t5))
% 0.34/0.61  (step t431.t7 (cl (= (=> (= tptp.a 0) false) (not (= tptp.a 0)))) :rule implies_simplify)
% 0.34/0.61  (step t431.t8 (cl (not (=> (= tptp.a 0) false)) (not (= tptp.a 0))) :rule equiv1 :premises (t431.t7))
% 0.34/0.61  (step t431.t9 (cl (not (= tptp.a 0))) :rule resolution :premises (t431.t6 t431.t8))
% 0.34/0.61  (step t431.t10 (cl) :rule resolution :premises (t431.a0 t431.t9))
% 0.34/0.61  (step t431 (cl (not (= tptp.a 0)) (not (>= tptp.a 2)) false) :rule subproof :discharge (t431.a0 t431.a1))
% 0.34/0.61  (step t432 (cl (not (and (= tptp.a 0) (>= tptp.a 2))) (= tptp.a 0)) :rule and_pos)
% 0.34/0.61  (step t433 (cl (not (and (= tptp.a 0) (>= tptp.a 2))) (>= tptp.a 2)) :rule and_pos)
% 0.34/0.61  (step t434 (cl false (not (and (= tptp.a 0) (>= tptp.a 2))) (not (and (= tptp.a 0) (>= tptp.a 2)))) :rule resolution :premises (t431 t432 t433))
% 0.34/0.61  (step t435 (cl (not (and (= tptp.a 0) (>= tptp.a 2))) (not (and (= tptp.a 0) (>= tptp.a 2))) false) :rule reordering :premises (t434))
% 0.34/0.61  (step t436 (cl (not (and (= tptp.a 0) (>= tptp.a 2))) false) :rule contraction :premises (t435))
% 0.34/0.61  (step t437 (cl (=> (and (= tptp.a 0) (>= tptp.a 2)) false) false) :rule resolution :premises (t430 t436))
% 0.34/0.61  (step t438 (cl (=> (and (= tptp.a 0) (>= tptp.a 2)) false) (not false)) :rule implies_neg2)
% 0.34/0.61  (step t439 (cl (=> (and (= tptp.a 0) (>= tptp.a 2)) false) (=> (and (= tptp.a 0) (>= tptp.a 2)) false)) :rule resolution :premises (t437 t438))
% 0.34/0.61  (step t440 (cl (=> (and (= tptp.a 0) (>= tptp.a 2)) false)) :rule contraction :premises (t439))
% 0.34/0.61  (step t441 (cl (= (=> (and (= tptp.a 0) (>= tptp.a 2)) false) (not (and (= tptp.a 0) (>= tptp.a 2))))) :rule implies_simplify)
% 0.34/0.61  (step t442 (cl (not (=> (and (= tptp.a 0) (>= tptp.a 2)) false)) (not (and (= tptp.a 0) (>= tptp.a 2)))) :rule equiv1 :premises (t441))
% 0.34/0.61  (step t443 (cl (not (and (= tptp.a 0) (>= tptp.a 2)))) :rule resolution :premises (t440 t442))
% 0.34/0.61  (step t444 (cl (= (and (= tptp.a 0) (>= tptp.a 2)) false)) :rule resolution :premises (t429 t443))
% 0.34/0.61  (step t445 (cl (= (=> (and (>= tptp.a 2) (= tptp.a 0)) (and (= tptp.a 0) (>= tptp.a 2))) (=> (and (>= tptp.a 2) (= tptp.a 0)) false))) :rule cong :premises (t425 t444))
% 0.34/0.61  (step t446 (cl (= (=> (and (>= tptp.a 2) (= tptp.a 0)) false) (not (and (>= tptp.a 2) (= tptp.a 0))))) :rule all_simplify)
% 0.34/0.61  (step t447 (cl (= (=> (and (>= tptp.a 2) (= tptp.a 0)) (and (= tptp.a 0) (>= tptp.a 2))) (not (and (>= tptp.a 2) (= tptp.a 0))))) :rule trans :premises (t445 t446))
% 0.34/0.61  (step t448 (cl (=> (and (>= tptp.a 2) (= tptp.a 0)) (and (= tptp.a 0) (>= tptp.a 2))) (and (>= tptp.a 2) (= tptp.a 0))) :rule implies_neg1)
% 0.34/0.61  (anchor :step t449)
% 0.34/0.61  (assume t449.a0 (>= tptp.a 2))
% 0.34/0.61  (assume t449.a1 (= tptp.a 0))
% 0.34/0.61  (step t449.t1 (cl (and (= tptp.a 0) (>= tptp.a 2)) (not (= tptp.a 0)) (not (>= tptp.a 2))) :rule and_neg)
% 0.34/0.61  (step t449.t2 (cl (and (= tptp.a 0) (>= tptp.a 2))) :rule resolution :premises (t449.t1 t449.a1 t449.a0))
% 0.34/0.61  (step t449 (cl (not (>= tptp.a 2)) (not (= tptp.a 0)) (and (= tptp.a 0) (>= tptp.a 2))) :rule subproof :discharge (t449.a0 t449.a1))
% 0.34/0.61  (step t450 (cl (not (and (>= tptp.a 2) (= tptp.a 0))) (>= tptp.a 2)) :rule and_pos)
% 0.34/0.61  (step t451 (cl (not (and (>= tptp.a 2) (= tptp.a 0))) (= tptp.a 0)) :rule and_pos)
% 0.34/0.61  (step t452 (cl (and (= tptp.a 0) (>= tptp.a 2)) (not (and (>= tptp.a 2) (= tptp.a 0))) (not (and (>= tptp.a 2) (= tptp.a 0)))) :rule resolution :premises (t449 t450 t451))
% 0.34/0.61  (step t453 (cl (not (and (>= tptp.a 2) (= tptp.a 0))) (not (and (>= tptp.a 2) (= tptp.a 0))) (and (= tptp.a 0) (>= tptp.a 2))) :rule reordering :premises (t452))
% 0.34/0.61  (step t454 (cl (not (and (>= tptp.a 2) (= tptp.a 0))) (and (= tptp.a 0) (>= tptp.a 2))) :rule contraction :premises (t453))
% 0.34/0.61  (step t455 (cl (=> (and (>= tptp.a 2) (= tptp.a 0)) (and (= tptp.a 0) (>= tptp.a 2))) (and (= tptp.a 0) (>= tptp.a 2))) :rule resolution :premises (t448 t454))
% 0.34/0.61  (step t456 (cl (=> (and (>= tptp.a 2) (= tptp.a 0)) (and (= tptp.a 0) (>= tptp.a 2))) (not (and (= tptp.a 0) (>= tptp.a 2)))) :rule implies_neg2)
% 0.34/0.61  (step t457 (cl (=> (and (>= tptp.a 2) (= tptp.a 0)) (and (= tptp.a 0) (>= tptp.a 2))) (=> (and (>= tptp.a 2) (= tptp.a 0)) (and (= tptp.a 0) (>= tptp.a 2)))) :rule resolution :premises (t455 t456))
% 0.34/0.61  (step t458 (cl (=> (and (>= tptp.a 2) (= tptp.a 0)) (and (= tptp.a 0) (>= tptp.a 2)))) :rule contraction :premises (t457))
% 0.34/0.61  (step t459 (cl (not (and (>= tptp.a 2) (= tptp.a 0)))) :rule resolution :premises (t424 t447 t458))
% 0.34/0.61  (step t460 (cl (not (>= tptp.a 2)) (not (= tptp.a 0))) :rule not_and :premises (t459))
% 0.34/0.61  (step t461 (cl (not (= (or (not (>= tptp.a 2)) (not (not (>= tptp.a 0)))) (or (not (>= tptp.a 2)) (>= tptp.a 0)))) (not (or (not (>= tptp.a 2)) (not (not (>= tptp.a 0))))) (or (not (>= tptp.a 2)) (>= tptp.a 0))) :rule equiv_pos2)
% 0.34/0.61  (step t462 (cl (= (not (>= tptp.a 2)) (not (>= tptp.a 2)))) :rule refl)
% 0.34/0.61  (step t463 (cl (= (or (not (>= tptp.a 2)) (not (not (>= tptp.a 0)))) (or (not (>= tptp.a 2)) (>= tptp.a 0)))) :rule cong :premises (t462 t11))
% 0.34/0.61  (step t464 (cl (not (= (=> (and (>= tptp.a 2) (not (>= tptp.a 0))) (and (not (>= tptp.a 0)) (>= tptp.a 2))) (not (and (>= tptp.a 2) (not (>= tptp.a 0)))))) (not (=> (and (>= tptp.a 2) (not (>= tptp.a 0))) (and (not (>= tptp.a 0)) (>= tptp.a 2)))) (not (and (>= tptp.a 2) (not (>= tptp.a 0))))) :rule equiv_pos2)
% 0.34/0.61  (step t465 (cl (= (and (>= tptp.a 2) (not (>= tptp.a 0))) (and (>= tptp.a 2) (not (>= tptp.a 0))))) :rule refl)
% 0.34/0.61  (step t466 (cl (= (= (and (not (>= tptp.a 0)) (>= tptp.a 2)) false) (not (and (not (>= tptp.a 0)) (>= tptp.a 2))))) :rule equiv_simplify)
% 0.34/0.61  (step t467 (cl (= (and (not (>= tptp.a 0)) (>= tptp.a 2)) false) (not (not (and (not (>= tptp.a 0)) (>= tptp.a 2))))) :rule equiv2 :premises (t466))
% 0.34/0.61  (step t468 (cl (not (not (not (and (not (>= tptp.a 0)) (>= tptp.a 2))))) (and (not (>= tptp.a 0)) (>= tptp.a 2))) :rule not_not)
% 0.34/0.61  (step t469 (cl (= (and (not (>= tptp.a 0)) (>= tptp.a 2)) false) (and (not (>= tptp.a 0)) (>= tptp.a 2))) :rule resolution :premises (t467 t468))
% 0.34/0.61  (step t470 (cl (=> (and (not (>= tptp.a 0)) (>= tptp.a 2)) false) (and (not (>= tptp.a 0)) (>= tptp.a 2))) :rule implies_neg1)
% 0.34/0.61  (anchor :step t471)
% 0.34/0.61  (assume t471.a0 (not (>= tptp.a 0)))
% 0.34/0.61  (assume t471.a1 (>= tptp.a 2))
% 0.34/0.61  (step t471.t1 (cl (not (= (not (<= tptp.a (- 1))) (> tptp.a (- 1)))) (not (not (<= tptp.a (- 1)))) (> tptp.a (- 1))) :rule equiv_pos2)
% 0.34/0.61  (step t471.t2 (cl (= (not (<= tptp.a (- 1))) (not (not (>= tptp.a 0))))) :rule cong :premises (t285))
% 0.34/0.61  (step t471.t3 (cl (= (not (<= tptp.a (- 1))) (>= tptp.a 0))) :rule trans :premises (t471.t2 t6))
% 0.34/0.61  (step t471.t4 (cl (= (> tptp.a (- 1)) (not (<= tptp.a (- 1))))) :rule all_simplify)
% 0.34/0.61  (step t471.t5 (cl (= (> tptp.a (- 1)) (>= tptp.a 0))) :rule trans :premises (t471.t4 t471.t3))
% 0.34/0.61  (step t471.t6 (cl (= (>= tptp.a 0) (> tptp.a (- 1)))) :rule symm :premises (t471.t5))
% 0.34/0.61  (step t471.t7 (cl (= (not (<= tptp.a (- 1))) (> tptp.a (- 1)))) :rule trans :premises (t471.t3 t471.t6))
% 0.34/0.61  (step t471.t8 (cl (=> (<= tptp.a (- 1)) false) (<= tptp.a (- 1))) :rule implies_neg1)
% 0.34/0.61  (anchor :step t471.t9)
% 0.34/0.61  (assume t471.t9.a0 (<= tptp.a (- 1)))
% 0.34/0.61  (step t471.t9.t1 (cl (not (= (<= (+ (* 1.0 tptp.a) (* (- 1.0) tptp.a)) (+ (* 1.0 (- 1)) (* (- 1.0) 2))) false)) (not (<= (+ (* 1.0 tptp.a) (* (- 1.0) tptp.a)) (+ (* 1.0 (- 1)) (* (- 1.0) 2)))) false) :rule equiv_pos2)
% 0.34/0.61  (step t471.t9.t2 (cl (= (* 1.0 tptp.a) (to_real tptp.a))) :rule all_simplify)
% 0.34/0.61  (step t471.t9.t3 (cl (= (* (- 1.0) tptp.a) (to_real (* (- 1) tptp.a)))) :rule all_simplify)
% 0.34/0.61  (step t471.t9.t4 (cl (= (+ (* 1.0 tptp.a) (* (- 1.0) tptp.a)) (+ (to_real tptp.a) (to_real (* (- 1) tptp.a))))) :rule cong :premises (t471.t9.t2 t471.t9.t3))
% 0.34/0.61  (step t471.t9.t5 (cl (= (+ (to_real tptp.a) (to_real (* (- 1) tptp.a))) 0.0)) :rule all_simplify)
% 0.34/0.61  (step t471.t9.t6 (cl (= (+ (* 1.0 tptp.a) (* (- 1.0) tptp.a)) 0.0)) :rule trans :premises (t471.t9.t4 t471.t9.t5))
% 0.34/0.61  (step t471.t9.t7 (cl (= (* 1.0 (- 1)) (- 1.0))) :rule all_simplify)
% 0.34/0.61  (step t471.t9.t8 (cl (= (* (- 1.0) 2) (- 2.0))) :rule all_simplify)
% 0.34/0.61  (step t471.t9.t9 (cl (= (+ (* 1.0 (- 1)) (* (- 1.0) 2)) (+ (- 1.0) (- 2.0)))) :rule cong :premises (t471.t9.t7 t471.t9.t8))
% 0.34/0.61  (step t471.t9.t10 (cl (= (+ (- 1.0) (- 2.0)) (- 3.0))) :rule all_simplify)
% 0.34/0.61  (step t471.t9.t11 (cl (= (+ (* 1.0 (- 1)) (* (- 1.0) 2)) (- 3.0))) :rule trans :premises (t471.t9.t9 t471.t9.t10))
% 0.34/0.61  (step t471.t9.t12 (cl (= (<= (+ (* 1.0 tptp.a) (* (- 1.0) tptp.a)) (+ (* 1.0 (- 1)) (* (- 1.0) 2))) (<= 0.0 (- 3.0)))) :rule cong :premises (t471.t9.t6 t471.t9.t11))
% 0.34/0.61  (step t471.t9.t13 (cl (= (<= 0.0 (- 3.0)) false)) :rule all_simplify)
% 0.34/0.61  (step t471.t9.t14 (cl (= (<= (+ (* 1.0 tptp.a) (* (- 1.0) tptp.a)) (+ (* 1.0 (- 1)) (* (- 1.0) 2))) false)) :rule trans :premises (t471.t9.t12 t471.t9.t13))
% 0.34/0.61  (step t471.t9.t15 (cl (not (<= (* 1.0 tptp.a) (* 1.0 (- 1)))) (not (<= (* (- 1.0) tptp.a) (* (- 1.0) 2))) (<= (+ (* 1.0 tptp.a) (* (- 1.0) tptp.a)) (+ (* 1.0 (- 1)) (* (- 1.0) 2)))) :rule la_generic :args (1 1 1))
% 0.34/0.61  (step t471.t9.t16 (cl (=> (and (> 1.0 0) (<= tptp.a (- 1))) (<= (* 1.0 tptp.a) (* 1.0 (- 1))))) :rule la_mult_pos)
% 0.34/0.61  (step t471.t9.t17 (cl (not (and (> 1.0 0) (<= tptp.a (- 1)))) (<= (* 1.0 tptp.a) (* 1.0 (- 1)))) :rule implies :premises (t471.t9.t16))
% 0.34/0.61  (step t471.t9.t18 (cl (and (> 1.0 0) (<= tptp.a (- 1))) (not (> 1.0 0)) (not (<= tptp.a (- 1)))) :rule and_neg)
% 0.34/0.61  (step t471.t9.t19 (cl (= (= (> 1.0 0) true) (> 1.0 0))) :rule equiv_simplify)
% 0.34/0.61  (step t471.t9.t20 (cl (not (= (> 1.0 0) true)) (> 1.0 0)) :rule equiv1 :premises (t471.t9.t19))
% 0.34/0.61  (step t471.t9.t21 (cl (= (> 1.0 0) true)) :rule hole :args ((> 1.0 0)))
% 0.34/0.61  (step t471.t9.t22 (cl (> 1.0 0)) :rule resolution :premises (t471.t9.t20 t471.t9.t21))
% 0.34/0.61  (step t471.t9.t23 (cl (and (> 1.0 0) (<= tptp.a (- 1)))) :rule resolution :premises (t471.t9.t18 t471.t9.t22 t471.t9.a0))
% 0.34/0.61  (step t471.t9.t24 (cl (<= (* 1.0 tptp.a) (* 1.0 (- 1)))) :rule resolution :premises (t471.t9.t17 t471.t9.t23))
% 0.34/0.61  (step t471.t9.t25 (cl (=> (and (< (- 1.0) 0) (>= tptp.a 2)) (<= (* (- 1.0) tptp.a) (* (- 1.0) 2)))) :rule la_mult_neg)
% 0.34/0.61  (step t471.t9.t26 (cl (not (and (< (- 1.0) 0) (>= tptp.a 2))) (<= (* (- 1.0) tptp.a) (* (- 1.0) 2))) :rule implies :premises (t471.t9.t25))
% 0.34/0.61  (step t471.t9.t27 (cl (and (< (- 1.0) 0) (>= tptp.a 2)) (not (< (- 1.0) 0)) (not (>= tptp.a 2))) :rule and_neg)
% 0.34/0.61  (step t471.t9.t28 (cl (= (= (< (- 1.0) 0) true) (< (- 1.0) 0))) :rule equiv_simplify)
% 0.34/0.61  (step t471.t9.t29 (cl (not (= (< (- 1.0) 0) true)) (< (- 1.0) 0)) :rule equiv1 :premises (t471.t9.t28))
% 0.34/0.61  (step t471.t9.t30 (cl (= (< (- 1.0) 0) true)) :rule hole :args ((< (- 1.0) 0)))
% 0.34/0.61  (step t471.t9.t31 (cl (< (- 1.0) 0)) :rule resolution :premises (t471.t9.t29 t471.t9.t30))
% 0.34/0.61  (step t471.t9.t32 (cl (and (< (- 1.0) 0) (>= tptp.a 2))) :rule resolution :premises (t471.t9.t27 t471.t9.t31 t471.a1))
% 0.34/0.61  (step t471.t9.t33 (cl (<= (* (- 1.0) tptp.a) (* (- 1.0) 2))) :rule resolution :premises (t471.t9.t26 t471.t9.t32))
% 0.34/0.61  (step t471.t9.t34 (cl (<= (+ (* 1.0 tptp.a) (* (- 1.0) tptp.a)) (+ (* 1.0 (- 1)) (* (- 1.0) 2)))) :rule resolution :premises (t471.t9.t15 t471.t9.t24 t471.t9.t33))
% 0.34/0.61  (step t471.t9.t35 (cl false) :rule resolution :premises (t471.t9.t1 t471.t9.t14 t471.t9.t34))
% 0.34/0.61  (step t471.t9 (cl (not (<= tptp.a (- 1))) false) :rule subproof :discharge (t471.t9.a0))
% 0.34/0.61  (step t471.t10 (cl (=> (<= tptp.a (- 1)) false) false) :rule resolution :premises (t471.t8 t471.t9))
% 0.34/0.61  (step t471.t11 (cl (=> (<= tptp.a (- 1)) false) (not false)) :rule implies_neg2)
% 0.34/0.61  (step t471.t12 (cl (=> (<= tptp.a (- 1)) false) (=> (<= tptp.a (- 1)) false)) :rule resolution :premises (t471.t10 t471.t11))
% 0.34/0.61  (step t471.t13 (cl (=> (<= tptp.a (- 1)) false)) :rule contraction :premises (t471.t12))
% 0.34/0.61  (step t471.t14 (cl (= (=> (<= tptp.a (- 1)) false) (not (<= tptp.a (- 1))))) :rule implies_simplify)
% 0.34/0.61  (step t471.t15 (cl (not (=> (<= tptp.a (- 1)) false)) (not (<= tptp.a (- 1)))) :rule equiv1 :premises (t471.t14))
% 0.34/0.61  (step t471.t16 (cl (not (<= tptp.a (- 1)))) :rule resolution :premises (t471.t13 t471.t15))
% 0.34/0.61  (step t471.t17 (cl (> tptp.a (- 1))) :rule resolution :premises (t471.t1 t471.t7 t471.t16))
% 0.34/0.61  (step t471.t18 (cl (not (= (<= tptp.a (- 1)) (not (> tptp.a (- 1))))) (not (<= tptp.a (- 1))) (not (> tptp.a (- 1)))) :rule equiv_pos2)
% 0.34/0.61  (step t471.t19 (cl (= (not (> tptp.a (- 1))) (not (>= tptp.a 0)))) :rule cong :premises (t471.t5))
% 0.34/0.61  (step t471.t20 (cl (= (not (>= tptp.a 0)) (not (> tptp.a (- 1))))) :rule symm :premises (t471.t19))
% 0.34/0.61  (step t471.t21 (cl (= (<= tptp.a (- 1)) (not (> tptp.a (- 1))))) :rule trans :premises (t285 t471.t20))
% 0.34/0.61  (step t471.t22 (cl (not (< tptp.a 0)) (<= tptp.a (- 1))) :rule la_generic :args (1 1))
% 0.34/0.61  (step t471.t23 (cl (not (= (not (>= tptp.a 0)) (< tptp.a 0))) (not (not (>= tptp.a 0))) (< tptp.a 0)) :rule equiv_pos2)
% 0.34/0.61  (step t471.t24 (cl (= (not (>= tptp.a 0)) (< tptp.a 0))) :rule symm :premises (t15))
% 0.34/0.61  (step t471.t25 (cl (< tptp.a 0)) :rule resolution :premises (t471.t23 t471.t24 t471.a0))
% 0.34/0.61  (step t471.t26 (cl (<= tptp.a (- 1))) :rule resolution :premises (t471.t22 t471.t25))
% 0.34/0.61  (step t471.t27 (cl (not (> tptp.a (- 1)))) :rule resolution :premises (t471.t18 t471.t21 t471.t26))
% 0.34/0.61  (step t471.t28 (cl) :rule resolution :premises (t471.t17 t471.t27))
% 0.34/0.61  (step t471 (cl (not (not (>= tptp.a 0))) (not (>= tptp.a 2)) false) :rule subproof :discharge (t471.a0 t471.a1))
% 0.34/0.61  (step t472 (cl (not (and (not (>= tptp.a 0)) (>= tptp.a 2))) (not (>= tptp.a 0))) :rule and_pos)
% 0.34/0.61  (step t473 (cl (not (and (not (>= tptp.a 0)) (>= tptp.a 2))) (>= tptp.a 2)) :rule and_pos)
% 0.34/0.61  (step t474 (cl false (not (and (not (>= tptp.a 0)) (>= tptp.a 2))) (not (and (not (>= tptp.a 0)) (>= tptp.a 2)))) :rule resolution :premises (t471 t472 t473))
% 0.34/0.61  (step t475 (cl (not (and (not (>= tptp.a 0)) (>= tptp.a 2))) (not (and (not (>= tptp.a 0)) (>= tptp.a 2))) false) :rule reordering :premises (t474))
% 0.34/0.61  (step t476 (cl (not (and (not (>= tptp.a 0)) (>= tptp.a 2))) false) :rule contraction :premises (t475))
% 0.34/0.61  (step t477 (cl (=> (and (not (>= tptp.a 0)) (>= tptp.a 2)) false) false) :rule resolution :premises (t470 t476))
% 0.34/0.61  (step t478 (cl (=> (and (not (>= tptp.a 0)) (>= tptp.a 2)) false) (not false)) :rule implies_neg2)
% 0.34/0.61  (step t479 (cl (=> (and (not (>= tptp.a 0)) (>= tptp.a 2)) false) (=> (and (not (>= tptp.a 0)) (>= tptp.a 2)) false)) :rule resolution :premises (t477 t478))
% 0.34/0.61  (step t480 (cl (=> (and (not (>= tptp.a 0)) (>= tptp.a 2)) false)) :rule contraction :premises (t479))
% 0.34/0.61  (step t481 (cl (= (=> (and (not (>= tptp.a 0)) (>= tptp.a 2)) false) (not (and (not (>= tptp.a 0)) (>= tptp.a 2))))) :rule implies_simplify)
% 0.34/0.61  (step t482 (cl (not (=> (and (not (>= tptp.a 0)) (>= tptp.a 2)) false)) (not (and (not (>= tptp.a 0)) (>= tptp.a 2)))) :rule equiv1 :premises (t481))
% 0.34/0.61  (step t483 (cl (not (and (not (>= tptp.a 0)) (>= tptp.a 2)))) :rule resolution :premises (t480 t482))
% 0.34/0.61  (step t484 (cl (= (and (not (>= tptp.a 0)) (>= tptp.a 2)) false)) :rule resolution :premises (t469 t483))
% 0.34/0.61  (step t485 (cl (= (=> (and (>= tptp.a 2) (not (>= tptp.a 0))) (and (not (>= tptp.a 0)) (>= tptp.a 2))) (=> (and (>= tptp.a 2) (not (>= tptp.a 0))) false))) :rule cong :premises (t465 t484))
% 0.34/0.61  (step t486 (cl (= (=> (and (>= tptp.a 2) (not (>= tptp.a 0))) false) (not (and (>= tptp.a 2) (not (>= tptp.a 0)))))) :rule all_simplify)
% 0.34/0.61  (step t487 (cl (= (=> (and (>= tptp.a 2) (not (>= tptp.a 0))) (and (not (>= tptp.a 0)) (>= tptp.a 2))) (not (and (>= tptp.a 2) (not (>= tptp.a 0)))))) :rule trans :premises (t485 t486))
% 0.34/0.61  (step t488 (cl (=> (and (>= tptp.a 2) (not (>= tptp.a 0))) (and (not (>= tptp.a 0)) (>= tptp.a 2))) (and (>= tptp.a 2) (not (>= tptp.a 0)))) :rule implies_neg1)
% 0.34/0.61  (anchor :step t489)
% 0.34/0.61  (assume t489.a0 (>= tptp.a 2))
% 0.34/0.61  (assume t489.a1 (not (>= tptp.a 0)))
% 0.34/0.61  (step t489.t1 (cl (and (not (>= tptp.a 0)) (>= tptp.a 2)) (not (not (>= tptp.a 0))) (not (>= tptp.a 2))) :rule and_neg)
% 0.34/0.61  (step t489.t2 (cl (and (not (>= tptp.a 0)) (>= tptp.a 2))) :rule resolution :premises (t489.t1 t489.a1 t489.a0))
% 0.34/0.61  (step t489 (cl (not (>= tptp.a 2)) (not (not (>= tptp.a 0))) (and (not (>= tptp.a 0)) (>= tptp.a 2))) :rule subproof :discharge (t489.a0 t489.a1))
% 0.34/0.61  (step t490 (cl (not (and (>= tptp.a 2) (not (>= tptp.a 0)))) (>= tptp.a 2)) :rule and_pos)
% 0.34/0.61  (step t491 (cl (not (and (>= tptp.a 2) (not (>= tptp.a 0)))) (not (>= tptp.a 0))) :rule and_pos)
% 0.34/0.61  (step t492 (cl (and (not (>= tptp.a 0)) (>= tptp.a 2)) (not (and (>= tptp.a 2) (not (>= tptp.a 0)))) (not (and (>= tptp.a 2) (not (>= tptp.a 0))))) :rule resolution :premises (t489 t490 t491))
% 0.34/0.61  (step t493 (cl (not (and (>= tptp.a 2) (not (>= tptp.a 0)))) (not (and (>= tptp.a 2) (not (>= tptp.a 0)))) (and (not (>= tptp.a 0)) (>= tptp.a 2))) :rule reordering :premises (t492))
% 0.34/0.61  (step t494 (cl (not (and (>= tptp.a 2) (not (>= tptp.a 0)))) (and (not (>= tptp.a 0)) (>= tptp.a 2))) :rule contraction :premises (t493))
% 0.34/0.61  (step t495 (cl (=> (and (>= tptp.a 2) (not (>= tptp.a 0))) (and (not (>= tptp.a 0)) (>= tptp.a 2))) (and (not (>= tptp.a 0)) (>= tptp.a 2))) :rule resolution :premises (t488 t494))
% 0.34/0.61  (step t496 (cl (=> (and (>= tptp.a 2) (not (>= tptp.a 0))) (and (not (>= tptp.a 0)) (>= tptp.a 2))) (not (and (not (>= tptp.a 0)) (>= tptp.a 2)))) :rule implies_neg2)
% 0.34/0.61  (step t497 (cl (=> (and (>= tptp.a 2) (not (>= tptp.a 0))) (and (not (>= tptp.a 0)) (>= tptp.a 2))) (=> (and (>= tptp.a 2) (not (>= tptp.a 0))) (and (not (>= tptp.a 0)) (>= tptp.a 2)))) :rule resolution :premises (t495 t496))
% 0.34/0.61  (step t498 (cl (=> (and (>= tptp.a 2) (not (>= tptp.a 0))) (and (not (>= tptp.a 0)) (>= tptp.a 2)))) :rule contraction :premises (t497))
% 0.34/0.61  (step t499 (cl (not (and (>= tptp.a 2) (not (>= tptp.a 0))))) :rule resolution :premises (t464 t487 t498))
% 0.34/0.61  (step t500 (cl (not (>= tptp.a 2)) (not (not (>= tptp.a 0)))) :rule not_and :premises (t499))
% 0.34/0.61  (step t501 (cl (or (not (>= tptp.a 2)) (not (not (>= tptp.a 0)))) (not (not (>= tptp.a 2)))) :rule or_neg)
% 0.34/0.61  (step t502 (cl (or (not (>= tptp.a 2)) (not (not (>= tptp.a 0)))) (not (not (not (>= tptp.a 0))))) :rule or_neg)
% 0.34/0.61  (step t503 (cl (or (not (>= tptp.a 2)) (not (not (>= tptp.a 0)))) (or (not (>= tptp.a 2)) (not (not (>= tptp.a 0))))) :rule resolution :premises (t500 t501 t502))
% 0.34/0.61  (step t504 (cl (or (not (>= tptp.a 2)) (not (not (>= tptp.a 0))))) :rule contraction :premises (t503))
% 0.34/0.61  (step t505 (cl (or (not (>= tptp.a 2)) (>= tptp.a 0))) :rule resolution :premises (t461 t463 t504))
% 0.34/0.61  (step t506 (cl (not (>= tptp.a 2)) (>= tptp.a 0)) :rule or :premises (t505))
% 0.34/0.61  (step t507 (cl (>= (* tptp.a tptp.a tptp.a) 4) (not (>= tptp.a 2)) (not (>= tptp.a 2)) (not (>= tptp.a 2))) :rule resolution :premises (t423 t460 t506))
% 0.34/0.61  (step t508 (cl (>= (* tptp.a tptp.a tptp.a) 4) (not (>= tptp.a 2))) :rule contraction :premises (t507))
% 0.34/0.61  (step t509 (cl (not (= (or (not (not (>= (* tptp.a tptp.a tptp.a) 4))) (not (not (>= tptp.a 2)))) (or (>= (* tptp.a tptp.a tptp.a) 4) (>= tptp.a 2)))) (not (or (not (not (>= (* tptp.a tptp.a tptp.a) 4))) (not (not (>= tptp.a 2))))) (or (>= (* tptp.a tptp.a tptp.a) 4) (>= tptp.a 2))) :rule equiv_pos2)
% 0.34/0.61  (step t510 (cl (= (or (not (not (>= (* tptp.a tptp.a tptp.a) 4))) (not (not (>= tptp.a 2)))) (or (>= (* tptp.a tptp.a tptp.a) 4) (>= tptp.a 2)))) :rule cong :premises (t168 t84))
% 0.34/0.61  (step t511 (cl (not (not (>= (* tptp.a tptp.a tptp.a) 4))) (not (not (>= tptp.a 2)))) :rule not_equiv2 :premises (t156))
% 0.34/0.61  (step t512 (cl (or (not (not (>= (* tptp.a tptp.a tptp.a) 4))) (not (not (>= tptp.a 2)))) (not (not (not (>= (* tptp.a tptp.a tptp.a) 4))))) :rule or_neg)
% 0.34/0.61  (step t513 (cl (or (not (not (>= (* tptp.a tptp.a tptp.a) 4))) (not (not (>= tptp.a 2)))) (not (not (not (>= tptp.a 2))))) :rule or_neg)
% 0.34/0.61  (step t514 (cl (or (not (not (>= (* tptp.a tptp.a tptp.a) 4))) (not (not (>= tptp.a 2)))) (or (not (not (>= (* tptp.a tptp.a tptp.a) 4))) (not (not (>= tptp.a 2))))) :rule resolution :premises (t511 t512 t513))
% 0.34/0.61  (step t515 (cl (or (not (not (>= (* tptp.a tptp.a tptp.a) 4))) (not (not (>= tptp.a 2))))) :rule contraction :premises (t514))
% 0.34/0.61  (step t516 (cl (or (>= (* tptp.a tptp.a tptp.a) 4) (>= tptp.a 2))) :rule resolution :premises (t509 t510 t515))
% 0.34/0.61  (step t517 (cl (>= (* tptp.a tptp.a tptp.a) 4) (>= tptp.a 2)) :rule or :premises (t516))
% 0.34/0.61  (step t518 (cl (>= (* tptp.a tptp.a tptp.a) 4) (>= (* tptp.a tptp.a tptp.a) 4)) :rule resolution :premises (t508 t517))
% 0.34/0.61  (step t519 (cl (>= (* tptp.a tptp.a tptp.a) 4)) :rule contraction :premises (t518))
% 0.34/0.61  (step t520 (cl (not (>= tptp.a 2))) :rule resolution :premises (t157 t519))
% 0.34/0.61  (step t521 (cl (or (not (= tptp.a 1)) (= (* tptp.a tptp.a tptp.a) 1))) :rule hole :args ((or (not (= tptp.a 1)) (= (* tptp.a tptp.a tptp.a) 1)) 3))
% 0.34/0.61  (step t522 (cl (not (= tptp.a 1)) (= (* tptp.a tptp.a tptp.a) 1)) :rule or :premises (t521))
% 0.34/0.61  (step t523 (cl (= (* tptp.a tptp.a tptp.a) 1) (not (= tptp.a 1))) :rule reordering :premises (t522))
% 0.34/0.61  (step t524 (cl (not (= (=> (and (>= (* tptp.a tptp.a tptp.a) 4) (= (* tptp.a tptp.a tptp.a) 1)) (and (= (* tptp.a tptp.a tptp.a) 1) (>= (* tptp.a tptp.a tptp.a) 4))) (not (and (>= (* tptp.a tptp.a tptp.a) 4) (= (* tptp.a tptp.a tptp.a) 1))))) (not (=> (and (>= (* tptp.a tptp.a tptp.a) 4) (= (* tptp.a tptp.a tptp.a) 1)) (and (= (* tptp.a tptp.a tptp.a) 1) (>= (* tptp.a tptp.a tptp.a) 4)))) (not (and (>= (* tptp.a tptp.a tptp.a) 4) (= (* tptp.a tptp.a tptp.a) 1)))) :rule equiv_pos2)
% 0.34/0.61  (step t525 (cl (= (and (>= (* tptp.a tptp.a tptp.a) 4) (= (* tptp.a tptp.a tptp.a) 1)) (and (>= (* tptp.a tptp.a tptp.a) 4) (= (* tptp.a tptp.a tptp.a) 1)))) :rule refl)
% 0.34/0.61  (step t526 (cl (= (= (and (= (* tptp.a tptp.a tptp.a) 1) (>= (* tptp.a tptp.a tptp.a) 4)) false) (not (and (= (* tptp.a tptp.a tptp.a) 1) (>= (* tptp.a tptp.a tptp.a) 4))))) :rule equiv_simplify)
% 0.34/0.61  (step t527 (cl (= (and (= (* tptp.a tptp.a tptp.a) 1) (>= (* tptp.a tptp.a tptp.a) 4)) false) (not (not (and (= (* tptp.a tptp.a tptp.a) 1) (>= (* tptp.a tptp.a tptp.a) 4))))) :rule equiv2 :premises (t526))
% 0.34/0.61  (step t528 (cl (not (not (not (and (= (* tptp.a tptp.a tptp.a) 1) (>= (* tptp.a tptp.a tptp.a) 4))))) (and (= (* tptp.a tptp.a tptp.a) 1) (>= (* tptp.a tptp.a tptp.a) 4))) :rule not_not)
% 0.34/0.61  (step t529 (cl (= (and (= (* tptp.a tptp.a tptp.a) 1) (>= (* tptp.a tptp.a tptp.a) 4)) false) (and (= (* tptp.a tptp.a tptp.a) 1) (>= (* tptp.a tptp.a tptp.a) 4))) :rule resolution :premises (t527 t528))
% 0.34/0.61  (step t530 (cl (=> (and (= (* tptp.a tptp.a tptp.a) 1) (>= (* tptp.a tptp.a tptp.a) 4)) false) (and (= (* tptp.a tptp.a tptp.a) 1) (>= (* tptp.a tptp.a tptp.a) 4))) :rule implies_neg1)
% 0.34/0.61  (anchor :step t531)
% 0.34/0.61  (assume t531.a0 (= (* tptp.a tptp.a tptp.a) 1))
% 0.34/0.61  (assume t531.a1 (>= (* tptp.a tptp.a tptp.a) 4))
% 0.34/0.61  (step t531.t1 (cl (=> (= (* tptp.a tptp.a tptp.a) 1) false) (= (* tptp.a tptp.a tptp.a) 1)) :rule implies_neg1)
% 0.34/0.61  (anchor :step t531.t2)
% 0.34/0.61  (assume t531.t2.a0 (= (* tptp.a tptp.a tptp.a) 1))
% 0.34/0.61  (step t531.t2.t1 (cl (not (= (<= (+ (* 1.0 (* tptp.a tptp.a tptp.a)) (* (- 1.0) (* tptp.a tptp.a tptp.a))) (+ (* 1.0 1) (* (- 1.0) 4))) false)) (not (<= (+ (* 1.0 (* tptp.a tptp.a tptp.a)) (* (- 1.0) (* tptp.a tptp.a tptp.a))) (+ (* 1.0 1) (* (- 1.0) 4)))) false) :rule equiv_pos2)
% 0.34/0.61  (step t531.t2.t2 (cl (= (* 1.0 (* tptp.a tptp.a tptp.a)) (to_real (* tptp.a tptp.a tptp.a)))) :rule all_simplify)
% 0.34/0.61  (step t531.t2.t3 (cl (= (* (- 1.0) (* tptp.a tptp.a tptp.a)) (to_real (* (- 1) (* tptp.a tptp.a tptp.a))))) :rule all_simplify)
% 0.34/0.61  (step t531.t2.t4 (cl (= (+ (* 1.0 (* tptp.a tptp.a tptp.a)) (* (- 1.0) (* tptp.a tptp.a tptp.a))) (+ (to_real (* tptp.a tptp.a tptp.a)) (to_real (* (- 1) (* tptp.a tptp.a tptp.a)))))) :rule cong :premises (t531.t2.t2 t531.t2.t3))
% 0.34/0.61  (step t531.t2.t5 (cl (= (+ (to_real (* tptp.a tptp.a tptp.a)) (to_real (* (- 1) (* tptp.a tptp.a tptp.a)))) 0.0)) :rule all_simplify)
% 0.34/0.61  (step t531.t2.t6 (cl (= (+ (* 1.0 (* tptp.a tptp.a tptp.a)) (* (- 1.0) (* tptp.a tptp.a tptp.a))) 0.0)) :rule trans :premises (t531.t2.t4 t531.t2.t5))
% 0.34/0.61  (step t531.t2.t7 (cl (= (* 1.0 1) 1.0)) :rule all_simplify)
% 0.34/0.61  (step t531.t2.t8 (cl (= (* (- 1.0) 4) (- 4.0))) :rule all_simplify)
% 0.34/0.61  (step t531.t2.t9 (cl (= (+ (* 1.0 1) (* (- 1.0) 4)) (+ 1.0 (- 4.0)))) :rule cong :premises (t531.t2.t7 t531.t2.t8))
% 0.34/0.61  (step t531.t2.t10 (cl (= (+ 1.0 (- 4.0)) (- 3.0))) :rule all_simplify)
% 0.34/0.61  (step t531.t2.t11 (cl (= (+ (* 1.0 1) (* (- 1.0) 4)) (- 3.0))) :rule trans :premises (t531.t2.t9 t531.t2.t10))
% 0.34/0.61  (step t531.t2.t12 (cl (= (<= (+ (* 1.0 (* tptp.a tptp.a tptp.a)) (* (- 1.0) (* tptp.a tptp.a tptp.a))) (+ (* 1.0 1) (* (- 1.0) 4))) (<= 0.0 (- 3.0)))) :rule cong :premises (t531.t2.t6 t531.t2.t11))
% 0.34/0.61  (step t531.t2.t13 (cl (= (<= 0.0 (- 3.0)) false)) :rule all_simplify)
% 0.34/0.61  (step t531.t2.t14 (cl (= (<= (+ (* 1.0 (* tptp.a tptp.a tptp.a)) (* (- 1.0) (* tptp.a tptp.a tptp.a))) (+ (* 1.0 1) (* (- 1.0) 4))) false)) :rule trans :premises (t531.t2.t12 t531.t2.t13))
% 0.34/0.61  (step t531.t2.t15 (cl (not (= (* 1.0 (* tptp.a tptp.a tptp.a)) (* 1.0 1))) (not (<= (* (- 1.0) (* tptp.a tptp.a tptp.a)) (* (- 1.0) 4))) (<= (+ (* 1.0 (* tptp.a tptp.a tptp.a)) (* (- 1.0) (* tptp.a tptp.a tptp.a))) (+ (* 1.0 1) (* (- 1.0) 4)))) :rule la_generic :args ((- 1) 1 1))
% 0.34/0.61  (step t531.t2.t16 (cl (=> (and (> 1.0 0) (= (* tptp.a tptp.a tptp.a) 1)) (= (* 1.0 (* tptp.a tptp.a tptp.a)) (* 1.0 1)))) :rule la_mult_pos)
% 0.34/0.61  (step t531.t2.t17 (cl (not (and (> 1.0 0) (= (* tptp.a tptp.a tptp.a) 1))) (= (* 1.0 (* tptp.a tptp.a tptp.a)) (* 1.0 1))) :rule implies :premises (t531.t2.t16))
% 0.34/0.61  (step t531.t2.t18 (cl (and (> 1.0 0) (= (* tptp.a tptp.a tptp.a) 1)) (not (> 1.0 0)) (not (= (* tptp.a tptp.a tptp.a) 1))) :rule and_neg)
% 0.34/0.61  (step t531.t2.t19 (cl (= (= (> 1.0 0) true) (> 1.0 0))) :rule equiv_simplify)
% 0.34/0.61  (step t531.t2.t20 (cl (not (= (> 1.0 0) true)) (> 1.0 0)) :rule equiv1 :premises (t531.t2.t19))
% 0.34/0.61  (step t531.t2.t21 (cl (= (> 1.0 0) true)) :rule hole :args ((> 1.0 0)))
% 0.34/0.61  (step t531.t2.t22 (cl (> 1.0 0)) :rule resolution :premises (t531.t2.t20 t531.t2.t21))
% 0.34/0.61  (step t531.t2.t23 (cl (and (> 1.0 0) (= (* tptp.a tptp.a tptp.a) 1))) :rule resolution :premises (t531.t2.t18 t531.t2.t22 t531.t2.a0))
% 0.34/0.61  (step t531.t2.t24 (cl (= (* 1.0 (* tptp.a tptp.a tptp.a)) (* 1.0 1))) :rule resolution :premises (t531.t2.t17 t531.t2.t23))
% 0.34/0.61  (step t531.t2.t25 (cl (=> (and (< (- 1.0) 0) (>= (* tptp.a tptp.a tptp.a) 4)) (<= (* (- 1.0) (* tptp.a tptp.a tptp.a)) (* (- 1.0) 4)))) :rule la_mult_neg)
% 0.34/0.61  (step t531.t2.t26 (cl (not (and (< (- 1.0) 0) (>= (* tptp.a tptp.a tptp.a) 4))) (<= (* (- 1.0) (* tptp.a tptp.a tptp.a)) (* (- 1.0) 4))) :rule implies :premises (t531.t2.t25))
% 0.34/0.61  (step t531.t2.t27 (cl (and (< (- 1.0) 0) (>= (* tptp.a tptp.a tptp.a) 4)) (not (< (- 1.0) 0)) (not (>= (* tptp.a tptp.a tptp.a) 4))) :rule and_neg)
% 0.34/0.61  (step t531.t2.t28 (cl (= (= (< (- 1.0) 0) true) (< (- 1.0) 0))) :rule equiv_simplify)
% 0.34/0.61  (step t531.t2.t29 (cl (not (= (< (- 1.0) 0) true)) (< (- 1.0) 0)) :rule equiv1 :premises (t531.t2.t28))
% 0.34/0.61  (step t531.t2.t30 (cl (= (< (- 1.0) 0) true)) :rule hole :args ((< (- 1.0) 0)))
% 0.34/0.61  (step t531.t2.t31 (cl (< (- 1.0) 0)) :rule resolution :premises (t531.t2.t29 t531.t2.t30))
% 0.34/0.61  (step t531.t2.t32 (cl (and (< (- 1.0) 0) (>= (* tptp.a tptp.a tptp.a) 4))) :rule resolution :premises (t531.t2.t27 t531.t2.t31 t531.a1))
% 0.34/0.61  (step t531.t2.t33 (cl (<= (* (- 1.0) (* tptp.a tptp.a tptp.a)) (* (- 1.0) 4))) :rule resolution :premises (t531.t2.t26 t531.t2.t32))
% 0.34/0.61  (step t531.t2.t34 (cl (<= (+ (* 1.0 (* tptp.a tptp.a tptp.a)) (* (- 1.0) (* tptp.a tptp.a tptp.a))) (+ (* 1.0 1) (* (- 1.0) 4)))) :rule resolution :premises (t531.t2.t15 t531.t2.t24 t531.t2.t33))
% 0.34/0.61  (step t531.t2.t35 (cl false) :rule resolution :premises (t531.t2.t1 t531.t2.t14 t531.t2.t34))
% 0.34/0.61  (step t531.t2 (cl (not (= (* tptp.a tptp.a tptp.a) 1)) false) :rule subproof :discharge (t531.t2.a0))
% 0.34/0.61  (step t531.t3 (cl (=> (= (* tptp.a tptp.a tptp.a) 1) false) false) :rule resolution :premises (t531.t1 t531.t2))
% 0.34/0.61  (step t531.t4 (cl (=> (= (* tptp.a tptp.a tptp.a) 1) false) (not false)) :rule implies_neg2)
% 0.34/0.61  (step t531.t5 (cl (=> (= (* tptp.a tptp.a tptp.a) 1) false) (=> (= (* tptp.a tptp.a tptp.a) 1) false)) :rule resolution :premises (t531.t3 t531.t4))
% 0.34/0.61  (step t531.t6 (cl (=> (= (* tptp.a tptp.a tptp.a) 1) false)) :rule contraction :premises (t531.t5))
% 0.34/0.61  (step t531.t7 (cl (= (=> (= (* tptp.a tptp.a tptp.a) 1) false) (not (= (* tptp.a tptp.a tptp.a) 1)))) :rule implies_simplify)
% 0.34/0.61  (step t531.t8 (cl (not (=> (= (* tptp.a tptp.a tptp.a) 1) false)) (not (= (* tptp.a tptp.a tptp.a) 1))) :rule equiv1 :premises (t531.t7))
% 0.34/0.61  (step t531.t9 (cl (not (= (* tptp.a tptp.a tptp.a) 1))) :rule resolution :premises (t531.t6 t531.t8))
% 0.34/0.61  (step t531.t10 (cl) :rule resolution :premises (t531.a0 t531.t9))
% 0.34/0.61  (step t531 (cl (not (= (* tptp.a tptp.a tptp.a) 1)) (not (>= (* tptp.a tptp.a tptp.a) 4)) false) :rule subproof :discharge (t531.a0 t531.a1))
% 0.34/0.61  (step t532 (cl (not (and (= (* tptp.a tptp.a tptp.a) 1) (>= (* tptp.a tptp.a tptp.a) 4))) (= (* tptp.a tptp.a tptp.a) 1)) :rule and_pos)
% 0.34/0.61  (step t533 (cl (not (and (= (* tptp.a tptp.a tptp.a) 1) (>= (* tptp.a tptp.a tptp.a) 4))) (>= (* tptp.a tptp.a tptp.a) 4)) :rule and_pos)
% 0.34/0.61  (step t534 (cl false (not (and (= (* tptp.a tptp.a tptp.a) 1) (>= (* tptp.a tptp.a tptp.a) 4))) (not (and (= (* tptp.a tptp.a tptp.a) 1) (>= (* tptp.a tptp.a tptp.a) 4)))) :rule resolution :premises (t531 t532 t533))
% 0.34/0.61  (step t535 (cl (not (and (= (* tptp.a tptp.a tptp.a) 1) (>= (* tptp.a tptp.a tptp.a) 4))) (not (and (= (* tptp.a tptp.a tptp.a) 1) (>= (* tptp.a tptp.a tptp.a) 4))) false) :rule reordering :premises (t534))
% 0.34/0.61  (step t536 (cl (not (and (= (* tptp.a tptp.a tptp.a) 1) (>= (* tptp.a tptp.a tptp.a) 4))) false) :rule contraction :premises (t535))
% 0.34/0.61  (step t537 (cl (=> (and (= (* tptp.a tptp.a tptp.a) 1) (>= (* tptp.a tptp.a tptp.a) 4)) false) false) :rule resolution :premises (t530 t536))
% 0.34/0.61  (step t538 (cl (=> (and (= (* tptp.a tptp.a tptp.a) 1) (>= (* tptp.a tptp.a tptp.a) 4)) false) (not false)) :rule implies_neg2)
% 0.34/0.61  (step t539 (cl (=> (and (= (* tptp.a tptp.a tptp.a) 1) (>= (* tptp.a tptp.a tptp.a) 4)) false) (=> (and (= (* tptp.a tptp.a tptp.a) 1) (>= (* tptp.a tptp.a tptp.a) 4)) false)) :rule resolution :premises (t537 t538))
% 0.34/0.61  (step t540 (cl (=> (and (= (* tptp.a tptp.a tptp.a) 1) (>= (* tptp.a tptp.a tptp.a) 4)) false)) :rule contraction :premises (t539))
% 0.34/0.61  (step t541 (cl (= (=> (and (= (* tptp.a tptp.a tptp.a) 1) (>= (* tptp.a tptp.a tptp.a) 4)) false) (not (and (= (* tptp.a tptp.a tptp.a) 1) (>= (* tptp.a tptp.a tptp.a) 4))))) :rule implies_simplify)
% 0.34/0.61  (step t542 (cl (not (=> (and (= (* tptp.a tptp.a tptp.a) 1) (>= (* tptp.a tptp.a tptp.a) 4)) false)) (not (and (= (* tptp.a tptp.a tptp.a) 1) (>= (* tptp.a tptp.a tptp.a) 4)))) :rule equiv1 :premises (t541))
% 0.34/0.61  (step t543 (cl (not (and (= (* tptp.a tptp.a tptp.a) 1) (>= (* tptp.a tptp.a tptp.a) 4)))) :rule resolution :premises (t540 t542))
% 0.34/0.61  (step t544 (cl (= (and (= (* tptp.a tptp.a tptp.a) 1) (>= (* tptp.a tptp.a tptp.a) 4)) false)) :rule resolution :premises (t529 t543))
% 0.34/0.61  (step t545 (cl (= (=> (and (>= (* tptp.a tptp.a tptp.a) 4) (= (* tptp.a tptp.a tptp.a) 1)) (and (= (* tptp.a tptp.a tptp.a) 1) (>= (* tptp.a tptp.a tptp.a) 4))) (=> (and (>= (* tptp.a tptp.a tptp.a) 4) (= (* tptp.a tptp.a tptp.a) 1)) false))) :rule cong :premises (t525 t544))
% 0.34/0.61  (step t546 (cl (= (=> (and (>= (* tptp.a tptp.a tptp.a) 4) (= (* tptp.a tptp.a tptp.a) 1)) false) (not (and (>= (* tptp.a tptp.a tptp.a) 4) (= (* tptp.a tptp.a tptp.a) 1))))) :rule all_simplify)
% 0.34/0.61  (step t547 (cl (= (=> (and (>= (* tptp.a tptp.a tptp.a) 4) (= (* tptp.a tptp.a tptp.a) 1)) (and (= (* tptp.a tptp.a tptp.a) 1) (>= (* tptp.a tptp.a tptp.a) 4))) (not (and (>= (* tptp.a tptp.a tptp.a) 4) (= (* tptp.a tptp.a tptp.a) 1))))) :rule trans :premises (t545 t546))
% 0.34/0.61  (step t548 (cl (=> (and (>= (* tptp.a tptp.a tptp.a) 4) (= (* tptp.a tptp.a tptp.a) 1)) (and (= (* tptp.a tptp.a tptp.a) 1) (>= (* tptp.a tptp.a tptp.a) 4))) (and (>= (* tptp.a tptp.a tptp.a) 4) (= (* tptp.a tptp.a tptp.a) 1))) :rule implies_neg1)
% 0.34/0.61  (anchor :step t549)
% 0.34/0.61  (assume t549.a0 (>= (* tptp.a tptp.a tptp.a) 4))
% 0.34/0.61  (assume t549.a1 (= (* tptp.a tptp.a tptp.a) 1))
% 0.34/0.61  (step t549.t1 (cl (and (= (* tptp.a tptp.a tptp.a) 1) (>= (* tptp.a tptp.a tptp.a) 4)) (not (= (* tptp.a tptp.a tptp.a) 1)) (not (>= (* tptp.a tptp.a tptp.a) 4))) :rule and_neg)
% 0.34/0.61  (step t549.t2 (cl (and (= (* tptp.a tptp.a tptp.a) 1) (>= (* tptp.a tptp.a tptp.a) 4))) :rule resolution :premises (t549.t1 t549.a1 t549.a0))
% 0.34/0.61  (step t549 (cl (not (>= (* tptp.a tptp.a tptp.a) 4)) (not (= (* tptp.a tptp.a tptp.a) 1)) (and (= (* tptp.a tptp.a tptp.a) 1) (>= (* tptp.a tptp.a tptp.a) 4))) :rule subproof :discharge (t549.a0 t549.a1))
% 0.34/0.61  (step t550 (cl (not (and (>= (* tptp.a tptp.a tptp.a) 4) (= (* tptp.a tptp.a tptp.a) 1))) (>= (* tptp.a tptp.a tptp.a) 4)) :rule and_pos)
% 0.34/0.61  (step t551 (cl (not (and (>= (* tptp.a tptp.a tptp.a) 4) (= (* tptp.a tptp.a tptp.a) 1))) (= (* tptp.a tptp.a tptp.a) 1)) :rule and_pos)
% 0.34/0.61  (step t552 (cl (and (= (* tptp.a tptp.a tptp.a) 1) (>= (* tptp.a tptp.a tptp.a) 4)) (not (and (>= (* tptp.a tptp.a tptp.a) 4) (= (* tptp.a tptp.a tptp.a) 1))) (not (and (>= (* tptp.a tptp.a tptp.a) 4) (= (* tptp.a tptp.a tptp.a) 1)))) :rule resolution :premises (t549 t550 t551))
% 0.34/0.61  (step t553 (cl (not (and (>= (* tptp.a tptp.a tptp.a) 4) (= (* tptp.a tptp.a tptp.a) 1))) (not (and (>= (* tptp.a tptp.a tptp.a) 4) (= (* tptp.a tptp.a tptp.a) 1))) (and (= (* tptp.a tptp.a tptp.a) 1) (>= (* tptp.a tptp.a tptp.a) 4))) :rule reordering :premises (t552))
% 0.34/0.61  (step t554 (cl (not (and (>= (* tptp.a tptp.a tptp.a) 4) (= (* tptp.a tptp.a tptp.a) 1))) (and (= (* tptp.a tptp.a tptp.a) 1) (>= (* tptp.a tptp.a tptp.a) 4))) :rule contraction :premises (t553))
% 0.34/0.61  (step t555 (cl (=> (and (>= (* tptp.a tptp.a tptp.a) 4) (= (* tptp.a tptp.a tptp.a) 1)) (and (= (* tptp.a tptp.a tptp.a) 1) (>= (* tptp.a tptp.a tptp.a) 4))) (and (= (* tptp.a tptp.a tptp.a) 1) (>= (* tptp.a tptp.a tptp.a) 4))) :rule resolution :premises (t548 t554))
% 0.34/0.61  (step t556 (cl (=> (and (>= (* tptp.a tptp.a tptp.a) 4) (= (* tptp.a tptp.a tptp.a) 1)) (and (= (* tptp.a tptp.a tptp.a) 1) (>= (* tptp.a tptp.a tptp.a) 4))) (not (and (= (* tptp.a tptp.a tptp.a) 1) (>= (* tptp.a tptp.a tptp.a) 4)))) :rule implies_neg2)
% 0.34/0.61  (step t557 (cl (=> (and (>= (* tptp.a tptp.a tptp.a) 4) (= (* tptp.a tptp.a tptp.a) 1)) (and (= (* tptp.a tptp.a tptp.a) 1) (>= (* tptp.a tptp.a tptp.a) 4))) (=> (and (>= (* tptp.a tptp.a tptp.a) 4) (= (* tptp.a tptp.a tptp.a) 1)) (and (= (* tptp.a tptp.a tptp.a) 1) (>= (* tptp.a tptp.a tptp.a) 4)))) :rule resolution :premises (t555 t556))
% 0.34/0.61  (step t558 (cl (=> (and (>= (* tptp.a tptp.a tptp.a) 4) (= (* tptp.a tptp.a tptp.a) 1)) (and (= (* tptp.a tptp.a tptp.a) 1) (>= (* tptp.a tptp.a tptp.a) 4)))) :rule contraction :premises (t557))
% 0.34/0.61  (step t559 (cl (not (and (>= (* tptp.a tptp.a tptp.a) 4) (= (* tptp.a tptp.a tptp.a) 1)))) :rule resolution :premises (t524 t547 t558))
% 0.34/0.61  (step t560 (cl (not (>= (* tptp.a tptp.a tptp.a) 4)) (not (= (* tptp.a tptp.a tptp.a) 1))) :rule not_and :premises (t559))
% 0.34/0.61  (step t561 (cl (not (= (* tptp.a tptp.a tptp.a) 1))) :rule resolution :premises (t560 t519))
% 0.34/0.61  (step t562 (cl (not (= tptp.a 1))) :rule resolution :premises (t523 t561))
% 0.34/0.61  (step t563 (cl (not (>= tptp.a 1))) :rule resolution :premises (t142 t520 t562))
% 0.34/0.61  (step t564 (cl (or (not (= tptp.a 0)) (= (* tptp.a tptp.a tptp.a) 0))) :rule hole :args ((or (not (= tptp.a 0)) (= (* tptp.a tptp.a tptp.a) 0)) 3))
% 0.34/0.61  (step t565 (cl (not (= tptp.a 0)) (= (* tptp.a tptp.a tptp.a) 0)) :rule or :premises (t564))
% 0.34/0.61  (step t566 (cl (not (= (=> (and (>= (* tptp.a tptp.a tptp.a) 4) (= (* tptp.a tptp.a tptp.a) 0)) (and (= (* tptp.a tptp.a tptp.a) 0) (>= (* tptp.a tptp.a tptp.a) 4))) (not (and (>= (* tptp.a tptp.a tptp.a) 4) (= (* tptp.a tptp.a tptp.a) 0))))) (not (=> (and (>= (* tptp.a tptp.a tptp.a) 4) (= (* tptp.a tptp.a tptp.a) 0)) (and (= (* tptp.a tptp.a tptp.a) 0) (>= (* tptp.a tptp.a tptp.a) 4)))) (not (and (>= (* tptp.a tptp.a tptp.a) 4) (= (* tptp.a tptp.a tptp.a) 0)))) :rule equiv_pos2)
% 0.34/0.61  (step t567 (cl (= (and (>= (* tptp.a tptp.a tptp.a) 4) (= (* tptp.a tptp.a tptp.a) 0)) (and (>= (* tptp.a tptp.a tptp.a) 4) (= (* tptp.a tptp.a tptp.a) 0)))) :rule refl)
% 0.34/0.61  (step t568 (cl (= (= (and (= (* tptp.a tptp.a tptp.a) 0) (>= (* tptp.a tptp.a tptp.a) 4)) false) (not (and (= (* tptp.a tptp.a tptp.a) 0) (>= (* tptp.a tptp.a tptp.a) 4))))) :rule equiv_simplify)
% 0.34/0.61  (step t569 (cl (= (and (= (* tptp.a tptp.a tptp.a) 0) (>= (* tptp.a tptp.a tptp.a) 4)) false) (not (not (and (= (* tptp.a tptp.a tptp.a) 0) (>= (* tptp.a tptp.a tptp.a) 4))))) :rule equiv2 :premises (t568))
% 0.34/0.61  (step t570 (cl (not (not (not (and (= (* tptp.a tptp.a tptp.a) 0) (>= (* tptp.a tptp.a tptp.a) 4))))) (and (= (* tptp.a tptp.a tptp.a) 0) (>= (* tptp.a tptp.a tptp.a) 4))) :rule not_not)
% 0.34/0.61  (step t571 (cl (= (and (= (* tptp.a tptp.a tptp.a) 0) (>= (* tptp.a tptp.a tptp.a) 4)) false) (and (= (* tptp.a tptp.a tptp.a) 0) (>= (* tptp.a tptp.a tptp.a) 4))) :rule resolution :premises (t569 t570))
% 0.34/0.61  (step t572 (cl (=> (and (= (* tptp.a tptp.a tptp.a) 0) (>= (* tptp.a tptp.a tptp.a) 4)) false) (and (= (* tptp.a tptp.a tptp.a) 0) (>= (* tptp.a tptp.a tptp.a) 4))) :rule implies_neg1)
% 0.34/0.61  (anchor :step t573)
% 0.34/0.61  (assume t573.a0 (= (* tptp.a tptp.a tptp.a) 0))
% 0.34/0.61  (assume t573.a1 (>= (* tptp.a tptp.a tptp.a) 4))
% 0.34/0.61  (step t573.t1 (cl (=> (= (* tptp.a tptp.a tptp.a) 0) false) (= (* tptp.a tptp.a tptp.a) 0)) :rule implies_neg1)
% 0.34/0.61  (anchor :step t573.t2)
% 0.34/0.61  (assume t573.t2.a0 (= (* tptp.a tptp.a tptp.a) 0))
% 0.34/0.61  (step t573.t2.t1 (cl (not (= (<= (+ (* 1.0 (* tptp.a tptp.a tptp.a)) (* (- 1.0) (* tptp.a tptp.a tptp.a))) (+ (* 1.0 0) (* (- 1.0) 4))) false)) (not (<= (+ (* 1.0 (* tptp.a tptp.a tptp.a)) (* (- 1.0) (* tptp.a tptp.a tptp.a))) (+ (* 1.0 0) (* (- 1.0) 4)))) false) :rule equiv_pos2)
% 0.34/0.61  (step t573.t2.t2 (cl (= (* 1.0 (* tptp.a tptp.a tptp.a)) (to_real (* tptp.a tptp.a tptp.a)))) :rule all_simplify)
% 0.34/0.61  (step t573.t2.t3 (cl (= (* (- 1.0) (* tptp.a tptp.a tptp.a)) (to_real (* (- 1) (* tptp.a tptp.a tptp.a))))) :rule all_simplify)
% 0.34/0.61  (step t573.t2.t4 (cl (= (+ (* 1.0 (* tptp.a tptp.a tptp.a)) (* (- 1.0) (* tptp.a tptp.a tptp.a))) (+ (to_real (* tptp.a tptp.a tptp.a)) (to_real (* (- 1) (* tptp.a tptp.a tptp.a)))))) :rule cong :premises (t573.t2.t2 t573.t2.t3))
% 0.34/0.61  (step t573.t2.t5 (cl (= (+ (to_real (* tptp.a tptp.a tptp.a)) (to_real (* (- 1) (* tptp.a tptp.a tptp.a)))) 0.0)) :rule all_simplify)
% 0.34/0.61  (step t573.t2.t6 (cl (= (+ (* 1.0 (* tptp.a tptp.a tptp.a)) (* (- 1.0) (* tptp.a tptp.a tptp.a))) 0.0)) :rule trans :premises (t573.t2.t4 t573.t2.t5))
% 0.34/0.61  (step t573.t2.t7 (cl (= (* 1.0 0) 0.0)) :rule all_simplify)
% 0.34/0.61  (step t573.t2.t8 (cl (= (* (- 1.0) 4) (- 4.0))) :rule all_simplify)
% 0.34/0.61  (step t573.t2.t9 (cl (= (+ (* 1.0 0) (* (- 1.0) 4)) (+ 0.0 (- 4.0)))) :rule cong :premises (t573.t2.t7 t573.t2.t8))
% 0.34/0.61  (step t573.t2.t10 (cl (= (+ 0.0 (- 4.0)) (- 4.0))) :rule all_simplify)
% 0.34/0.61  (step t573.t2.t11 (cl (= (+ (* 1.0 0) (* (- 1.0) 4)) (- 4.0))) :rule trans :premises (t573.t2.t9 t573.t2.t10))
% 0.34/0.61  (step t573.t2.t12 (cl (= (<= (+ (* 1.0 (* tptp.a tptp.a tptp.a)) (* (- 1.0) (* tptp.a tptp.a tptp.a))) (+ (* 1.0 0) (* (- 1.0) 4))) (<= 0.0 (- 4.0)))) :rule cong :premises (t573.t2.t6 t573.t2.t11))
% 0.34/0.61  (step t573.t2.t13 (cl (= (<= 0.0 (- 4.0)) false)) :rule all_simplify)
% 0.34/0.61  (step t573.t2.t14 (cl (= (<= (+ (* 1.0 (* tptp.a tptp.a tptp.a)) (* (- 1.0) (* tptp.a tptp.a tptp.a))) (+ (* 1.0 0) (* (- 1.0) 4))) false)) :rule trans :premises (t573.t2.t12 t573.t2.t13))
% 0.34/0.61  (step t573.t2.t15 (cl (not (= (* 1.0 (* tptp.a tptp.a tptp.a)) (* 1.0 0))) (not (<= (* (- 1.0) (* tptp.a tptp.a tptp.a)) (* (- 1.0) 4))) (<= (+ (* 1.0 (* tptp.a tptp.a tptp.a)) (* (- 1.0) (* tptp.a tptp.a tptp.a))) (+ (* 1.0 0) (* (- 1.0) 4)))) :rule la_generic :args ((- 1) 1 1))
% 0.34/0.61  (step t573.t2.t16 (cl (=> (and (> 1.0 0) (= (* tptp.a tptp.a tptp.a) 0)) (= (* 1.0 (* tptp.a tptp.a tptp.a)) (* 1.0 0)))) :rule la_mult_pos)
% 0.34/0.61  (step t573.t2.t17 (cl (not (and (> 1.0 0) (= (* tptp.a tptp.a tptp.a) 0))) (= (* 1.0 (* tptp.a tptp.a tptp.a)) (* 1.0 0))) :rule implies :premises (t573.t2.t16))
% 0.34/0.61  (step t573.t2.t18 (cl (and (> 1.0 0) (= (* tptp.a tptp.a tptp.a) 0)) (not (> 1.0 0)) (not (= (* tptp.a tptp.a tptp.a) 0))) :rule and_neg)
% 0.34/0.61  (step t573.t2.t19 (cl (= (= (> 1.0 0) true) (> 1.0 0))) :rule equiv_simplify)
% 0.34/0.61  (step t573.t2.t20 (cl (not (= (> 1.0 0) true)) (> 1.0 0)) :rule equiv1 :premises (t573.t2.t19))
% 0.34/0.61  (step t573.t2.t21 (cl (= (> 1.0 0) true)) :rule hole :args ((> 1.0 0)))
% 0.34/0.61  (step t573.t2.t22 (cl (> 1.0 0)) :rule resolution :premises (t573.t2.t20 t573.t2.t21))
% 0.34/0.61  (step t573.t2.t23 (cl (and (> 1.0 0) (= (* tptp.a tptp.a tptp.a) 0))) :rule resolution :premises (t573.t2.t18 t573.t2.t22 t573.t2.a0))
% 0.34/0.61  (step t573.t2.t24 (cl (= (* 1.0 (* tptp.a tptp.a tptp.a)) (* 1.0 0))) :rule resolution :premises (t573.t2.t17 t573.t2.t23))
% 0.34/0.61  (step t573.t2.t25 (cl (=> (and (< (- 1.0) 0) (>= (* tptp.a tptp.a tptp.a) 4)) (<= (* (- 1.0) (* tptp.a tptp.a tptp.a)) (* (- 1.0) 4)))) :rule la_mult_neg)
% 0.34/0.61  (step t573.t2.t26 (cl (not (and (< (- 1.0) 0) (>= (* tptp.a tptp.a tptp.a) 4))) (<= (* (- 1.0) (* tptp.a tptp.a tptp.a)) (* (- 1.0) 4))) :rule implies :premises (t573.t2.t25))
% 0.34/0.61  (step t573.t2.t27 (cl (and (< (- 1.0) 0) (>= (* tptp.a tptp.a tptp.a) 4)) (not (< (- 1.0) 0)) (not (>= (* tptp.a tptp.a tptp.a) 4))) :rule and_neg)
% 0.34/0.61  (step t573.t2.t28 (cl (= (= (< (- 1.0) 0) true) (< (- 1.0) 0))) :rule equiv_simplify)
% 0.34/0.61  (step t573.t2.t29 (cl (not (= (< (- 1.0) 0) true)) (< (- 1.0) 0)) :rule equiv1 :premises (t573.t2.t28))
% 0.34/0.61  (step t573.t2.t30 (cl (= (< (- 1.0) 0) true)) :rule hole :args ((< (- 1.0) 0)))
% 0.34/0.61  (step t573.t2.t31 (cl (< (- 1.0) 0)) :rule resolution :premises (t573.t2.t29 t573.t2.t30))
% 0.34/0.61  (step t573.t2.t32 (cl (and (< (- 1.0) 0) (>= (* tptp.a tptp.a tptp.a) 4))) :rule resolution :premises (t573.t2.t27 t573.t2.t31 t573.a1))
% 0.34/0.61  (step t573.t2.t33 (cl (<= (* (- 1.0) (* tptp.a tptp.a tptp.a)) (* (- 1.0) 4))) :rule resolution :premises (t573.t2.t26 t573.t2.t32))
% 0.34/0.61  (step t573.t2.t34 (cl (<= (+ (* 1.0 (* tptp.a tptp.a tptp.a)) (* (- 1.0) (* tptp.a tptp.a tptp.a))) (+ (* 1.0 0) (* (- 1.0) 4)))) :rule resolution :premises (t573.t2.t15 t573.t2.t24 t573.t2.t33))
% 0.34/0.61  (step t573.t2.t35 (cl false) :rule resolution :premises (t573.t2.t1 t573.t2.t14 t573.t2.t34))
% 0.34/0.61  (step t573.t2 (cl (not (= (* tptp.a tptp.a tptp.a) 0)) false) :rule subproof :discharge (t573.t2.a0))
% 0.34/0.61  (step t573.t3 (cl (=> (= (* tptp.a tptp.a tptp.a) 0) false) false) :rule resolution :premises (t573.t1 t573.t2))
% 0.34/0.61  (step t573.t4 (cl (=> (= (* tptp.a tptp.a tptp.a) 0) false) (not false)) :rule implies_neg2)
% 0.34/0.61  (step t573.t5 (cl (=> (= (* tptp.a tptp.a tptp.a) 0) false) (=> (= (* tptp.a tptp.a tptp.a) 0) false)) :rule resolution :premises (t573.t3 t573.t4))
% 0.34/0.61  (step t573.t6 (cl (=> (= (* tptp.a tptp.a tptp.a) 0) false)) :rule contraction :premises (t573.t5))
% 0.34/0.61  (step t573.t7 (cl (= (=> (= (* tptp.a tptp.a tptp.a) 0) false) (not (= (* tptp.a tptp.a tptp.a) 0)))) :rule implies_simplify)
% 0.34/0.61  (step t573.t8 (cl (not (=> (= (* tptp.a tptp.a tptp.a) 0) false)) (not (= (* tptp.a tptp.a tptp.a) 0))) :rule equiv1 :premises (t573.t7))
% 0.34/0.61  (step t573.t9 (cl (not (= (* tptp.a tptp.a tptp.a) 0))) :rule resolution :premises (t573.t6 t573.t8))
% 0.34/0.61  (step t573.t10 (cl) :rule resolution :premises (t573.a0 t573.t9))
% 0.34/0.61  (step t573 (cl (not (= (* tptp.a tptp.a tptp.a) 0)) (not (>= (* tptp.a tptp.a tptp.a) 4)) false) :rule subproof :discharge (t573.a0 t573.a1))
% 0.34/0.61  (step t574 (cl (not (and (= (* tptp.a tptp.a tptp.a) 0) (>= (* tptp.a tptp.a tptp.a) 4))) (= (* tptp.a tptp.a tptp.a) 0)) :rule and_pos)
% 0.34/0.61  (step t575 (cl (not (and (= (* tptp.a tptp.a tptp.a) 0) (>= (* tptp.a tptp.a tptp.a) 4))) (>= (* tptp.a tptp.a tptp.a) 4)) :rule and_pos)
% 0.34/0.61  (step t576 (cl false (not (and (= (* tptp.a tptp.a tptp.a) 0) (>= (* tptp.a tptp.a tptp.a) 4))) (not (and (= (* tptp.a tptp.a tptp.a) 0) (>= (* tptp.a tptp.a tptp.a) 4)))) :rule resolution :premises (t573 t574 t575))
% 0.34/0.61  (step t577 (cl (not (and (= (* tptp.a tptp.a tptp.a) 0) (>= (* tptp.a tptp.a tptp.a) 4))) (not (and (= (* tptp.a tptp.a tptp.a) 0) (>= (* tptp.a tptp.a tptp.a) 4))) false) :rule reordering :premises (t576))
% 0.34/0.61  (step t578 (cl (not (and (= (* tptp.a tptp.a tptp.a) 0) (>= (* tptp.a tptp.a tptp.a) 4))) false) :rule contraction :premises (t577))
% 0.34/0.61  (step t579 (cl (=> (and (= (* tptp.a tptp.a tptp.a) 0) (>= (* tptp.a tptp.a tptp.a) 4)) false) false) :rule resolution :premises (t572 t578))
% 0.34/0.61  (step t580 (cl (=> (and (= (* tptp.a tptp.a tptp.a) 0) (>= (* tptp.a tptp.a tptp.a) 4)) false) (not false)) :rule implies_neg2)
% 0.34/0.61  (step t581 (cl (=> (and (= (* tptp.a tptp.a tptp.a) 0) (>= (* tptp.a tptp.a tptp.a) 4)) false) (=> (and (= (* tptp.a tptp.a tptp.a) 0) (>= (* tptp.a tptp.a tptp.a) 4)) false)) :rule resolution :premises (t579 t580))
% 0.34/0.61  (step t582 (cl (=> (and (= (* tptp.a tptp.a tptp.a) 0) (>= (* tptp.a tptp.a tptp.a) 4)) false)) :rule contraction :premises (t581))
% 0.34/0.61  (step t583 (cl (= (=> (and (= (* tptp.a tptp.a tptp.a) 0) (>= (* tptp.a tptp.a tptp.a) 4)) false) (not (and (= (* tptp.a tptp.a tptp.a) 0) (>= (* tptp.a tptp.a tptp.a) 4))))) :rule implies_simplify)
% 0.34/0.61  (step t584 (cl (not (=> (and (= (* tptp.a tptp.a tptp.a) 0) (>= (* tptp.a tptp.a tptp.a) 4)) false)) (not (and (= (* tptp.a tptp.a tptp.a) 0) (>= (* tptp.a tptp.a tptp.a) 4)))) :rule equiv1 :premises (t583))
% 0.34/0.61  (step t585 (cl (not (and (= (* tptp.a tptp.a tptp.a) 0) (>= (* tptp.a tptp.a tptp.a) 4)))) :rule resolution :premises (t582 t584))
% 0.34/0.61  (step t586 (cl (= (and (= (* tptp.a tptp.a tptp.a) 0) (>= (* tptp.a tptp.a tptp.a) 4)) false)) :rule resolution :premises (t571 t585))
% 0.34/0.61  (step t587 (cl (= (=> (and (>= (* tptp.a tptp.a tptp.a) 4) (= (* tptp.a tptp.a tptp.a) 0)) (and (= (* tptp.a tptp.a tptp.a) 0) (>= (* tptp.a tptp.a tptp.a) 4))) (=> (and (>= (* tptp.a tptp.a tptp.a) 4) (= (* tptp.a tptp.a tptp.a) 0)) false))) :rule cong :premises (t567 t586))
% 0.34/0.61  (step t588 (cl (= (=> (and (>= (* tptp.a tptp.a tptp.a) 4) (= (* tptp.a tptp.a tptp.a) 0)) false) (not (and (>= (* tptp.a tptp.a tptp.a) 4) (= (* tptp.a tptp.a tptp.a) 0))))) :rule all_simplify)
% 0.34/0.61  (step t589 (cl (= (=> (and (>= (* tptp.a tptp.a tptp.a) 4) (= (* tptp.a tptp.a tptp.a) 0)) (and (= (* tptp.a tptp.a tptp.a) 0) (>= (* tptp.a tptp.a tptp.a) 4))) (not (and (>= (* tptp.a tptp.a tptp.a) 4) (= (* tptp.a tptp.a tptp.a) 0))))) :rule trans :premises (t587 t588))
% 0.34/0.61  (step t590 (cl (=> (and (>= (* tptp.a tptp.a tptp.a) 4) (= (* tptp.a tptp.a tptp.a) 0)) (and (= (* tptp.a tptp.a tptp.a) 0) (>= (* tptp.a tptp.a tptp.a) 4))) (and (>= (* tptp.a tptp.a tptp.a) 4) (= (* tptp.a tptp.a tptp.a) 0))) :rule implies_neg1)
% 0.34/0.61  (anchor :step t591)
% 0.34/0.61  (assume t591.a0 (>= (* tptp.a tptp.a tptp.a) 4))
% 0.34/0.61  (assume t591.a1 (= (* tptp.a tptp.a tptp.a) 0))
% 0.34/0.61  (step t591.t1 (cl (and (= (* tptp.a tptp.a tptp.a) 0) (>= (* tptp.a tptp.a tptp.a) 4)) (not (= (* tptp.a tptp.a tptp.a) 0)) (not (>= (* tptp.a tptp.a tptp.a) 4))) :rule and_neg)
% 0.34/0.61  (step t591.t2 (cl (and (= (* tptp.a tptp.a tptp.a) 0) (>= (* tptp.a tptp.a tptp.a) 4))) :rule resolution :premises (t591.t1 t591.a1 t591.a0))
% 0.34/0.61  (step t591 (cl (not (>= (* tptp.a tptp.a tptp.a) 4)) (not (= (* tptp.a tptp.a tptp.a) 0)) (and (= (* tptp.a tptp.a tptp.a) 0) (>= (* tptp.a tptp.a tptp.a) 4))) :rule subproof :discharge (t591.a0 t591.a1))
% 0.34/0.61  (step t592 (cl (not (and (>= (* tptp.a tptp.a tptp.a) 4) (= (* tptp.a tptp.a tptp.a) 0))) (>= (* tptp.a tptp.a tptp.a) 4)) :rule and_pos)
% 0.34/0.61  (step t593 (cl (not (and (>= (* tptp.a tptp.a tptp.a) 4) (= (* tptp.a tptp.a tptp.a) 0))) (= (* tptp.a tptp.a tptp.a) 0)) :rule and_pos)
% 0.34/0.61  (step t594 (cl (and (= (* tptp.a tptp.a tptp.a) 0) (>= (* tptp.a tptp.a tptp.a) 4)) (not (and (>= (* tptp.a tptp.a tptp.a) 4) (= (* tptp.a tptp.a tptp.a) 0))) (not (and (>= (* tptp.a tptp.a tptp.a) 4) (= (* tptp.a tptp.a tptp.a) 0)))) :rule resolution :premises (t591 t592 t593))
% 0.34/0.61  (step t595 (cl (not (and (>= (* tptp.a tptp.a tptp.a) 4) (= (* tptp.a tptp.a tptp.a) 0))) (not (and (>= (* tptp.a tptp.a tptp.a) 4) (= (* tptp.a tptp.a tptp.a) 0))) (and (= (* tptp.a tptp.a tptp.a) 0) (>= (* tptp.a tptp.a tptp.a) 4))) :rule reordering :premises (t594))
% 0.34/0.61  (step t596 (cl (not (and (>= (* tptp.a tptp.a tptp.a) 4) (= (* tptp.a tptp.a tptp.a) 0))) (and (= (* tptp.a tptp.a tptp.a) 0) (>= (* tptp.a tptp.a tptp.a) 4))) :rule contraction :premises (t595))
% 0.34/0.61  (step t597 (cl (=> (and (>= (* tptp.a tptp.a tptp.a) 4) (= (* tptp.a tptp.a tptp.a) 0)) (and (= (* tptp.a tptp.a tptp.a) 0) (>= (* tptp.a tptp.a tptp.a) 4))) (and (= (* tptp.a tptp.a tptp.a) 0) (>= (* tptp.a tptp.a tptp.a) 4))) :rule resolution :premises (t590 t596))
% 0.34/0.61  (step t598 (cl (=> (and (>= (* tptp.a tptp.a tptp.a) 4) (= (* tptp.a tptp.a tptp.a) 0)) (and (= (* tptp.a tptp.a tptp.a) 0) (>= (* tptp.a tptp.a tptp.a) 4))) (not (and (= (* tptp.a tptp.a tptp.a) 0) (>= (* tptp.a tptp.a tptp.a) 4)))) :rule implies_neg2)
% 0.34/0.61  (step t599 (cl (=> (and (>= (* tptp.a tptp.a tptp.a) 4) (= (* tptp.a tptp.a tptp.a) 0)) (and (= (* tptp.a tptp.a tptp.a) 0) (>= (* tptp.a tptp.a tptp.a) 4))) (=> (and (>= (* tptp.a tptp.a tptp.a) 4) (= (* tptp.a tptp.a tptp.a) 0)) (and (= (* tptp.a tptp.a tptp.a) 0) (>= (* tptp.a tptp.a tptp.a) 4)))) :rule resolution :premises (t597 t598))
% 0.34/0.61  (step t600 (cl (=> (and (>= (* tptp.a tptp.a tptp.a) 4) (= (* tptp.a tptp.a tptp.a) 0)) (and (= (* tptp.a tptp.a tptp.a) 0) (>= (* tptp.a tptp.a tptp.a) 4)))) :rule contraction :premises (t599))
% 0.34/0.61  (step t601 (cl (not (and (>= (* tptp.a tptp.a tptp.a) 4) (= (* tptp.a tptp.a tptp.a) 0)))) :rule resolution :premises (t566 t589 t600))
% 0.34/0.61  (step t602 (cl (not (>= (* tptp.a tptp.a tptp.a) 4)) (not (= (* tptp.a tptp.a tptp.a) 0))) :rule not_and :premises (t601))
% 0.34/0.61  (step t603 (cl (not (= (* tptp.a tptp.a tptp.a) 0))) :rule resolution :premises (t602 t519))
% 0.34/0.61  (step t604 (cl (not (= tptp.a 0))) :rule resolution :premises (t565 t603))
% 0.34/0.61  (step t605 (cl (not (>= tptp.a 0))) :rule resolution :premises (t73 t563 t604))
% 0.34/0.61  (step t606 (cl (=> (>= (* tptp.a tptp.a tptp.a) 4) (>= (* tptp.a tptp.a tptp.a) 0)) (>= (* tptp.a tptp.a tptp.a) 4)) :rule implies_neg1)
% 0.34/0.61  (anchor :step t607)
% 0.34/0.61  (assume t607.a0 (>= (* tptp.a tptp.a tptp.a) 4))
% 0.34/0.61  (step t607.t1 (cl (=> (>= (* tptp.a tptp.a tptp.a) 4) (>= (* tptp.a tptp.a tptp.a) 0)) (>= (* tptp.a tptp.a tptp.a) 4)) :rule implies_neg1)
% 0.34/0.61  (anchor :step t607.t2)
% 0.34/0.61  (assume t607.t2.a0 (>= (* tptp.a tptp.a tptp.a) 4))
% 0.34/0.61  (step t607.t2.t1 (cl (not (= (not (< (* tptp.a tptp.a tptp.a) 0)) (>= (* tptp.a tptp.a tptp.a) 0))) (not (not (< (* tptp.a tptp.a tptp.a) 0))) (>= (* tptp.a tptp.a tptp.a) 0)) :rule equiv_pos2)
% 0.34/0.61  (step t607.t2.t2 (cl (= (< (* tptp.a tptp.a tptp.a) 0) (not (>= (* tptp.a tptp.a tptp.a) 0)))) :rule all_simplify)
% 0.34/0.61  (step t607.t2.t3 (cl (= (not (< (* tptp.a tptp.a tptp.a) 0)) (not (not (>= (* tptp.a tptp.a tptp.a) 0))))) :rule cong :premises (t607.t2.t2))
% 0.34/0.61  (step t607.t2.t4 (cl (= (not (not (>= (* tptp.a tptp.a tptp.a) 0))) (>= (* tptp.a tptp.a tptp.a) 0))) :rule all_simplify)
% 0.34/0.61  (step t607.t2.t5 (cl (= (not (< (* tptp.a tptp.a tptp.a) 0)) (>= (* tptp.a tptp.a tptp.a) 0))) :rule trans :premises (t607.t2.t3 t607.t2.t4))
% 0.34/0.61  (step t607.t2.t6 (cl (=> (< (* tptp.a tptp.a tptp.a) 0) false) (< (* tptp.a tptp.a tptp.a) 0)) :rule implies_neg1)
% 0.34/0.61  (anchor :step t607.t2.t7)
% 0.34/0.61  (assume t607.t2.t7.a0 (< (* tptp.a tptp.a tptp.a) 0))
% 0.34/0.61  (step t607.t2.t7.t1 (cl (not (= (< (+ (* 1.0 (* tptp.a tptp.a tptp.a)) (* (- 1.0) (* tptp.a tptp.a tptp.a))) (+ (* 1.0 0) (* (- 1.0) 4))) false)) (not (< (+ (* 1.0 (* tptp.a tptp.a tptp.a)) (* (- 1.0) (* tptp.a tptp.a tptp.a))) (+ (* 1.0 0) (* (- 1.0) 4)))) false) :rule equiv_pos2)
% 0.34/0.61  (step t607.t2.t7.t2 (cl (= (< (+ (* 1.0 (* tptp.a tptp.a tptp.a)) (* (- 1.0) (* tptp.a tptp.a tptp.a))) (+ (* 1.0 0) (* (- 1.0) 4))) (not (>= (+ (* 1.0 (* tptp.a tptp.a tptp.a)) (* (- 1.0) (* tptp.a tptp.a tptp.a))) (+ (* 1.0 0) (* (- 1.0) 4)))))) :rule all_simplify)
% 0.34/0.61  (step t607.t2.t7.t3 (cl (= (* 1.0 (* tptp.a tptp.a tptp.a)) (to_real (* tptp.a tptp.a tptp.a)))) :rule all_simplify)
% 0.34/0.61  (step t607.t2.t7.t4 (cl (= (* (- 1.0) (* tptp.a tptp.a tptp.a)) (to_real (* (- 1) (* tptp.a tptp.a tptp.a))))) :rule all_simplify)
% 0.34/0.61  (step t607.t2.t7.t5 (cl (= (+ (* 1.0 (* tptp.a tptp.a tptp.a)) (* (- 1.0) (* tptp.a tptp.a tptp.a))) (+ (to_real (* tptp.a tptp.a tptp.a)) (to_real (* (- 1) (* tptp.a tptp.a tptp.a)))))) :rule cong :premises (t607.t2.t7.t3 t607.t2.t7.t4))
% 0.34/0.61  (step t607.t2.t7.t6 (cl (= (+ (to_real (* tptp.a tptp.a tptp.a)) (to_real (* (- 1) (* tptp.a tptp.a tptp.a)))) 0.0)) :rule all_simplify)
% 0.34/0.61  (step t607.t2.t7.t7 (cl (= (+ (* 1.0 (* tptp.a tptp.a tptp.a)) (* (- 1.0) (* tptp.a tptp.a tptp.a))) 0.0)) :rule trans :premises (t607.t2.t7.t5 t607.t2.t7.t6))
% 0.34/0.61  (step t607.t2.t7.t8 (cl (= (* 1.0 0) 0.0)) :rule all_simplify)
% 0.34/0.61  (step t607.t2.t7.t9 (cl (= (* (- 1.0) 4) (- 4.0))) :rule all_simplify)
% 0.34/0.61  (step t607.t2.t7.t10 (cl (= (+ (* 1.0 0) (* (- 1.0) 4)) (+ 0.0 (- 4.0)))) :rule cong :premises (t607.t2.t7.t8 t607.t2.t7.t9))
% 0.34/0.61  (step t607.t2.t7.t11 (cl (= (+ 0.0 (- 4.0)) (- 4.0))) :rule all_simplify)
% 0.34/0.61  (step t607.t2.t7.t12 (cl (= (+ (* 1.0 0) (* (- 1.0) 4)) (- 4.0))) :rule trans :premises (t607.t2.t7.t10 t607.t2.t7.t11))
% 0.34/0.61  (step t607.t2.t7.t13 (cl (= (>= (+ (* 1.0 (* tptp.a tptp.a tptp.a)) (* (- 1.0) (* tptp.a tptp.a tptp.a))) (+ (* 1.0 0) (* (- 1.0) 4))) (>= 0.0 (- 4.0)))) :rule cong :premises (t607.t2.t7.t7 t607.t2.t7.t12))
% 0.34/0.61  (step t607.t2.t7.t14 (cl (= (>= 0.0 (- 4.0)) true)) :rule all_simplify)
% 0.34/0.61  (step t607.t2.t7.t15 (cl (= (>= (+ (* 1.0 (* tptp.a tptp.a tptp.a)) (* (- 1.0) (* tptp.a tptp.a tptp.a))) (+ (* 1.0 0) (* (- 1.0) 4))) true)) :rule trans :premises (t607.t2.t7.t13 t607.t2.t7.t14))
% 0.34/0.61  (step t607.t2.t7.t16 (cl (= (not (>= (+ (* 1.0 (* tptp.a tptp.a tptp.a)) (* (- 1.0) (* tptp.a tptp.a tptp.a))) (+ (* 1.0 0) (* (- 1.0) 4)))) (not true))) :rule cong :premises (t607.t2.t7.t15))
% 0.34/0.61  (step t607.t2.t7.t17 (cl (= (not true) false)) :rule all_simplify)
% 0.34/0.61  (step t607.t2.t7.t18 (cl (= (not (>= (+ (* 1.0 (* tptp.a tptp.a tptp.a)) (* (- 1.0) (* tptp.a tptp.a tptp.a))) (+ (* 1.0 0) (* (- 1.0) 4)))) false)) :rule trans :premises (t607.t2.t7.t16 t607.t2.t7.t17))
% 0.34/0.61  (step t607.t2.t7.t19 (cl (= (< (+ (* 1.0 (* tptp.a tptp.a tptp.a)) (* (- 1.0) (* tptp.a tptp.a tptp.a))) (+ (* 1.0 0) (* (- 1.0) 4))) false)) :rule trans :premises (t607.t2.t7.t2 t607.t2.t7.t18))
% 0.34/0.61  (step t607.t2.t7.t20 (cl (not (< (* 1.0 (* tptp.a tptp.a tptp.a)) (* 1.0 0))) (not (<= (* (- 1.0) (* tptp.a tptp.a tptp.a)) (* (- 1.0) 4))) (< (+ (* 1.0 (* tptp.a tptp.a tptp.a)) (* (- 1.0) (* tptp.a tptp.a tptp.a))) (+ (* 1.0 0) (* (- 1.0) 4)))) :rule la_generic :args (1 1 1))
% 0.34/0.61  (step t607.t2.t7.t21 (cl (=> (and (> 1.0 0) (< (* tptp.a tptp.a tptp.a) 0)) (< (* 1.0 (* tptp.a tptp.a tptp.a)) (* 1.0 0)))) :rule la_mult_pos)
% 0.34/0.61  (step t607.t2.t7.t22 (cl (not (and (> 1.0 0) (< (* tptp.a tptp.a tptp.a) 0))) (< (* 1.0 (* tptp.a tptp.a tptp.a)) (* 1.0 0))) :rule implies :premises (t607.t2.t7.t21))
% 0.34/0.61  (step t607.t2.t7.t23 (cl (and (> 1.0 0) (< (* tptp.a tptp.a tptp.a) 0)) (not (> 1.0 0)) (not (< (* tptp.a tptp.a tptp.a) 0))) :rule and_neg)
% 0.34/0.61  (step t607.t2.t7.t24 (cl (= (= (> 1.0 0) true) (> 1.0 0))) :rule equiv_simplify)
% 0.34/0.61  (step t607.t2.t7.t25 (cl (not (= (> 1.0 0) true)) (> 1.0 0)) :rule equiv1 :premises (t607.t2.t7.t24))
% 0.34/0.61  (step t607.t2.t7.t26 (cl (= (> 1.0 0) true)) :rule hole :args ((> 1.0 0)))
% 0.34/0.61  (step t607.t2.t7.t27 (cl (> 1.0 0)) :rule resolution :premises (t607.t2.t7.t25 t607.t2.t7.t26))
% 0.34/0.61  (step t607.t2.t7.t28 (cl (and (> 1.0 0) (< (* tptp.a tptp.a tptp.a) 0))) :rule resolution :premises (t607.t2.t7.t23 t607.t2.t7.t27 t607.t2.t7.a0))
% 0.34/0.61  (step t607.t2.t7.t29 (cl (< (* 1.0 (* tptp.a tptp.a tptp.a)) (* 1.0 0))) :rule resolution :premises (t607.t2.t7.t22 t607.t2.t7.t28))
% 0.34/0.61  (step t607.t2.t7.t30 (cl (=> (and (< (- 1.0) 0) (>= (* tptp.a tptp.a tptp.a) 4)) (<= (* (- 1.0) (* tptp.a tptp.a tptp.a)) (* (- 1.0) 4)))) :rule la_mult_neg)
% 0.34/0.61  (step t607.t2.t7.t31 (cl (not (and (< (- 1.0) 0) (>= (* tptp.a tptp.a tptp.a) 4))) (<= (* (- 1.0) (* tptp.a tptp.a tptp.a)) (* (- 1.0) 4))) :rule implies :premises (t607.t2.t7.t30))
% 0.34/0.61  (step t607.t2.t7.t32 (cl (and (< (- 1.0) 0) (>= (* tptp.a tptp.a tptp.a) 4)) (not (< (- 1.0) 0)) (not (>= (* tptp.a tptp.a tptp.a) 4))) :rule and_neg)
% 0.34/0.61  (step t607.t2.t7.t33 (cl (= (= (< (- 1.0) 0) true) (< (- 1.0) 0))) :rule equiv_simplify)
% 0.34/0.61  (step t607.t2.t7.t34 (cl (not (= (< (- 1.0) 0) true)) (< (- 1.0) 0)) :rule equiv1 :premises (t607.t2.t7.t33))
% 0.34/0.61  (step t607.t2.t7.t35 (cl (= (< (- 1.0) 0) true)) :rule hole :args ((< (- 1.0) 0)))
% 0.34/0.61  (step t607.t2.t7.t36 (cl (< (- 1.0) 0)) :rule resolution :premises (t607.t2.t7.t34 t607.t2.t7.t35))
% 0.34/0.61  (step t607.t2.t7.t37 (cl (and (< (- 1.0) 0) (>= (* tptp.a tptp.a tptp.a) 4))) :rule resolution :premises (t607.t2.t7.t32 t607.t2.t7.t36 t607.t2.a0))
% 0.34/0.61  (step t607.t2.t7.t38 (cl (<= (* (- 1.0) (* tptp.a tptp.a tptp.a)) (* (- 1.0) 4))) :rule resolution :premises (t607.t2.t7.t31 t607.t2.t7.t37))
% 0.34/0.61  (step t607.t2.t7.t39 (cl (< (+ (* 1.0 (* tptp.a tptp.a tptp.a)) (* (- 1.0) (* tptp.a tptp.a tptp.a))) (+ (* 1.0 0) (* (- 1.0) 4)))) :rule resolution :premises (t607.t2.t7.t20 t607.t2.t7.t29 t607.t2.t7.t38))
% 0.34/0.61  (step t607.t2.t7.t40 (cl false) :rule resolution :premises (t607.t2.t7.t1 t607.t2.t7.t19 t607.t2.t7.t39))
% 0.34/0.61  (step t607.t2.t7 (cl (not (< (* tptp.a tptp.a tptp.a) 0)) false) :rule subproof :discharge (t607.t2.t7.a0))
% 0.34/0.61  (step t607.t2.t8 (cl (=> (< (* tptp.a tptp.a tptp.a) 0) false) false) :rule resolution :premises (t607.t2.t6 t607.t2.t7))
% 0.34/0.61  (step t607.t2.t9 (cl (=> (< (* tptp.a tptp.a tptp.a) 0) false) (not false)) :rule implies_neg2)
% 0.34/0.61  (step t607.t2.t10 (cl (=> (< (* tptp.a tptp.a tptp.a) 0) false) (=> (< (* tptp.a tptp.a tptp.a) 0) false)) :rule resolution :premises (t607.t2.t8 t607.t2.t9))
% 0.34/0.61  (step t607.t2.t11 (cl (=> (< (* tptp.a tptp.a tptp.a) 0) false)) :rule contraction :premises (t607.t2.t10))
% 0.34/0.61  (step t607.t2.t12 (cl (= (=> (< (* tptp.a tptp.a tptp.a) 0) false) (not (< (* tptp.a tptp.a tptp.a) 0)))) :rule implies_simplify)
% 0.34/0.61  (step t607.t2.t13 (cl (not (=> (< (* tptp.a tptp.a tptp.a) 0) false)) (not (< (* tptp.a tptp.a tptp.a) 0))) :rule equiv1 :premises (t607.t2.t12))
% 0.34/0.61  (step t607.t2.t14 (cl (not (< (* tptp.a tptp.a tptp.a) 0))) :rule resolution :premises (t607.t2.t11 t607.t2.t13))
% 0.34/0.61  (step t607.t2.t15 (cl (>= (* tptp.a tptp.a tptp.a) 0)) :rule resolution :premises (t607.t2.t1 t607.t2.t5 t607.t2.t14))
% 0.34/0.61  (step t607.t2 (cl (not (>= (* tptp.a tptp.a tptp.a) 4)) (>= (* tptp.a tptp.a tptp.a) 0)) :rule subproof :discharge (t607.t2.a0))
% 0.34/0.61  (step t607.t3 (cl (=> (>= (* tptp.a tptp.a tptp.a) 4) (>= (* tptp.a tptp.a tptp.a) 0)) (>= (* tptp.a tptp.a tptp.a) 0)) :rule resolution :premises (t607.t1 t607.t2))
% 0.34/0.61  (step t607.t4 (cl (=> (>= (* tptp.a tptp.a tptp.a) 4) (>= (* tptp.a tptp.a tptp.a) 0)) (not (>= (* tptp.a tptp.a tptp.a) 0))) :rule implies_neg2)
% 0.34/0.61  (step t607.t5 (cl (=> (>= (* tptp.a tptp.a tptp.a) 4) (>= (* tptp.a tptp.a tptp.a) 0)) (=> (>= (* tptp.a tptp.a tptp.a) 4) (>= (* tptp.a tptp.a tptp.a) 0))) :rule resolution :premises (t607.t3 t607.t4))
% 0.34/0.61  (step t607.t6 (cl (=> (>= (* tptp.a tptp.a tptp.a) 4) (>= (* tptp.a tptp.a tptp.a) 0))) :rule contraction :premises (t607.t5))
% 0.34/0.61  (step t607.t7 (cl (not (>= (* tptp.a tptp.a tptp.a) 4)) (>= (* tptp.a tptp.a tptp.a) 0)) :rule implies :premises (t607.t6))
% 0.34/0.61  (step t607.t8 (cl (>= (* tptp.a tptp.a tptp.a) 0)) :rule resolution :premises (t607.t7 t607.a0))
% 0.34/0.61  (step t607 (cl (not (>= (* tptp.a tptp.a tptp.a) 4)) (>= (* tptp.a tptp.a tptp.a) 0)) :rule subproof :discharge (t607.a0))
% 0.34/0.61  (step t608 (cl (=> (>= (* tptp.a tptp.a tptp.a) 4) (>= (* tptp.a tptp.a tptp.a) 0)) (>= (* tptp.a tptp.a tptp.a) 0)) :rule resolution :premises (t606 t607))
% 0.34/0.61  (step t609 (cl (=> (>= (* tptp.a tptp.a tptp.a) 4) (>= (* tptp.a tptp.a tptp.a) 0)) (not (>= (* tptp.a tptp.a tptp.a) 0))) :rule implies_neg2)
% 0.34/0.61  (step t610 (cl (=> (>= (* tptp.a tptp.a tptp.a) 4) (>= (* tptp.a tptp.a tptp.a) 0)) (=> (>= (* tptp.a tptp.a tptp.a) 4) (>= (* tptp.a tptp.a tptp.a) 0))) :rule resolution :premises (t608 t609))
% 0.34/0.61  (step t611 (cl (=> (>= (* tptp.a tptp.a tptp.a) 4) (>= (* tptp.a tptp.a tptp.a) 0))) :rule contraction :premises (t610))
% 0.34/0.61  (step t612 (cl (not (>= (* tptp.a tptp.a tptp.a) 4)) (>= (* tptp.a tptp.a tptp.a) 0)) :rule implies :premises (t611))
% 0.34/0.61  (step t613 (cl (>= (* tptp.a tptp.a tptp.a) 0)) :rule resolution :premises (t612 t519))
% 0.34/0.61  (step t614 (cl) :rule resolution :premises (t29 t605 t613))
% 0.34/0.61  
% 0.34/0.61  % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.8ok2jchqXr/cvc5---1.0.5_4442.smt2
% 0.34/0.61  % cvc5---1.0.5 exiting
% 0.34/0.61  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------