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

% Computer : n004.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:22 EDT 2024

% Result   : Theorem 0.47s 0.65s
% Output   : Proof 0.47s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13  % Problem    : ARI646_1 : TPTP v8.2.0. Released v6.3.0.
% 0.13/0.14  % Command    : do_cvc5 %s %d
% 0.14/0.36  % Computer : n004.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit   : 300
% 0.14/0.36  % WCLimit    : 300
% 0.14/0.36  % DateTime   : Mon May 27 05:22:09 EDT 2024
% 0.14/0.36  % CPUTime    : 
% 0.21/0.50  %----Proving TF0_ARI
% 0.47/0.65  --- Run --finite-model-find --decision=internal at 15...
% 0.47/0.65  % SZS status Theorem for /export/starexec/sandbox/tmp/tmp.YvsFOGAUxN/cvc5---1.0.5_29767.smt2
% 0.47/0.65  % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.YvsFOGAUxN/cvc5---1.0.5_29767.smt2
% 0.47/0.65  (assume a0 (not (= (and (> 10 tptp.a) (<= 0 tptp.a)) (or (= tptp.a 9) (= tptp.a 8) (= tptp.a 7) (= tptp.a 6) (= tptp.a 5) (= tptp.a 4) (= tptp.a 3) (= tptp.a 2) (= tptp.a 1) (= tptp.a 0)))))
% 0.47/0.65  (assume a1 true)
% 0.47/0.65  (step t1 (cl (not (= (or (and (not (>= tptp.a 10)) (>= tptp.a 0)) (not (not (>= tptp.a 10))) (not (>= tptp.a 0))) (or (and (not (>= tptp.a 10)) (>= tptp.a 0)) (>= tptp.a 10) (not (>= tptp.a 0))))) (not (or (and (not (>= tptp.a 10)) (>= tptp.a 0)) (not (not (>= tptp.a 10))) (not (>= tptp.a 0)))) (or (and (not (>= tptp.a 10)) (>= tptp.a 0)) (>= tptp.a 10) (not (>= tptp.a 0)))) :rule equiv_pos2)
% 0.47/0.65  (step t2 (cl (= (and (not (>= tptp.a 10)) (>= tptp.a 0)) (and (not (>= tptp.a 10)) (>= tptp.a 0)))) :rule refl)
% 0.47/0.65  (step t3 (cl (= (= (= (not (not (>= tptp.a 10))) (>= tptp.a 10)) true) (= (not (not (>= tptp.a 10))) (>= tptp.a 10)))) :rule equiv_simplify)
% 0.47/0.65  (step t4 (cl (not (= (= (not (not (>= tptp.a 10))) (>= tptp.a 10)) true)) (= (not (not (>= tptp.a 10))) (>= tptp.a 10))) :rule equiv1 :premises (t3))
% 0.47/0.65  (step t5 (cl (= (= (not (not (>= tptp.a 10))) (>= tptp.a 10)) (= (>= tptp.a 10) (not (not (>= tptp.a 10)))))) :rule all_simplify)
% 0.47/0.65  (step t6 (cl (= (>= tptp.a 10) (>= tptp.a 10))) :rule refl)
% 0.47/0.65  (step t7 (cl (= (not (not (>= tptp.a 10))) (>= tptp.a 10))) :rule all_simplify)
% 0.47/0.65  (step t8 (cl (= (= (>= tptp.a 10) (not (not (>= tptp.a 10)))) (= (>= tptp.a 10) (>= tptp.a 10)))) :rule cong :premises (t6 t7))
% 0.47/0.65  (step t9 (cl (= (= (>= tptp.a 10) (>= tptp.a 10)) true)) :rule all_simplify)
% 0.47/0.65  (step t10 (cl (= (= (>= tptp.a 10) (not (not (>= tptp.a 10)))) true)) :rule trans :premises (t8 t9))
% 0.47/0.65  (step t11 (cl (= (= (not (not (>= tptp.a 10))) (>= tptp.a 10)) true)) :rule trans :premises (t5 t10))
% 0.47/0.65  (step t12 (cl (= (not (not (>= tptp.a 10))) (>= tptp.a 10))) :rule resolution :premises (t4 t11))
% 0.47/0.65  (step t13 (cl (= (not (>= tptp.a 0)) (not (>= tptp.a 0)))) :rule refl)
% 0.47/0.65  (step t14 (cl (= (or (and (not (>= tptp.a 10)) (>= tptp.a 0)) (not (not (>= tptp.a 10))) (not (>= tptp.a 0))) (or (and (not (>= tptp.a 10)) (>= tptp.a 0)) (>= tptp.a 10) (not (>= tptp.a 0))))) :rule cong :premises (t2 t12 t13))
% 0.47/0.65  (step t15 (cl (and (not (>= tptp.a 10)) (>= tptp.a 0)) (not (not (>= tptp.a 10))) (not (>= tptp.a 0))) :rule and_neg)
% 0.47/0.65  (step t16 (cl (or (and (not (>= tptp.a 10)) (>= tptp.a 0)) (not (not (>= tptp.a 10))) (not (>= tptp.a 0))) (not (and (not (>= tptp.a 10)) (>= tptp.a 0)))) :rule or_neg)
% 0.47/0.65  (step t17 (cl (or (and (not (>= tptp.a 10)) (>= tptp.a 0)) (not (not (>= tptp.a 10))) (not (>= tptp.a 0))) (not (not (not (>= tptp.a 10))))) :rule or_neg)
% 0.47/0.65  (step t18 (cl (or (and (not (>= tptp.a 10)) (>= tptp.a 0)) (not (not (>= tptp.a 10))) (not (>= tptp.a 0))) (not (not (>= tptp.a 0)))) :rule or_neg)
% 0.47/0.65  (step t19 (cl (or (and (not (>= tptp.a 10)) (>= tptp.a 0)) (not (not (>= tptp.a 10))) (not (>= tptp.a 0))) (or (and (not (>= tptp.a 10)) (>= tptp.a 0)) (not (not (>= tptp.a 10))) (not (>= tptp.a 0))) (or (and (not (>= tptp.a 10)) (>= tptp.a 0)) (not (not (>= tptp.a 10))) (not (>= tptp.a 0)))) :rule resolution :premises (t15 t16 t17 t18))
% 0.47/0.65  (step t20 (cl (or (and (not (>= tptp.a 10)) (>= tptp.a 0)) (not (not (>= tptp.a 10))) (not (>= tptp.a 0)))) :rule contraction :premises (t19))
% 0.47/0.65  (step t21 (cl (or (and (not (>= tptp.a 10)) (>= tptp.a 0)) (>= tptp.a 10) (not (>= tptp.a 0)))) :rule resolution :premises (t1 t14 t20))
% 0.47/0.65  (step t22 (cl (and (not (>= tptp.a 10)) (>= tptp.a 0)) (>= tptp.a 10) (not (>= tptp.a 0))) :rule or :premises (t21))
% 0.47/0.65  (step t23 (cl (>= tptp.a 10) (and (not (>= tptp.a 10)) (>= tptp.a 0)) (not (>= tptp.a 0))) :rule reordering :premises (t22))
% 0.47/0.65  (step t24 (cl (not (= (not (= (and (> 10 tptp.a) (<= 0 tptp.a)) (or (= tptp.a 9) (= tptp.a 8) (= tptp.a 7) (= tptp.a 6) (= tptp.a 5) (= tptp.a 4) (= tptp.a 3) (= tptp.a 2) (= tptp.a 1) (= tptp.a 0)))) (not (= (or (= tptp.a 9) (= tptp.a 8) (= tptp.a 7) (= tptp.a 6) (= tptp.a 5) (= tptp.a 4) (= tptp.a 3) (= tptp.a 2) (= tptp.a 1) (= tptp.a 0)) (and (not (>= tptp.a 10)) (>= tptp.a 0)))))) (not (not (= (and (> 10 tptp.a) (<= 0 tptp.a)) (or (= tptp.a 9) (= tptp.a 8) (= tptp.a 7) (= tptp.a 6) (= tptp.a 5) (= tptp.a 4) (= tptp.a 3) (= tptp.a 2) (= tptp.a 1) (= tptp.a 0))))) (not (= (or (= tptp.a 9) (= tptp.a 8) (= tptp.a 7) (= tptp.a 6) (= tptp.a 5) (= tptp.a 4) (= tptp.a 3) (= tptp.a 2) (= tptp.a 1) (= tptp.a 0)) (and (not (>= tptp.a 10)) (>= tptp.a 0))))) :rule equiv_pos2)
% 0.47/0.65  (step t25 (cl (= (> 10 tptp.a) (not (<= 10 tptp.a)))) :rule all_simplify)
% 0.47/0.65  (step t26 (cl (= (<= 10 tptp.a) (>= tptp.a 10))) :rule all_simplify)
% 0.47/0.65  (step t27 (cl (= (not (<= 10 tptp.a)) (not (>= tptp.a 10)))) :rule cong :premises (t26))
% 0.47/0.65  (step t28 (cl (= (> 10 tptp.a) (not (>= tptp.a 10)))) :rule trans :premises (t25 t27))
% 0.47/0.65  (step t29 (cl (= (<= 0 tptp.a) (>= tptp.a 0))) :rule all_simplify)
% 0.47/0.65  (step t30 (cl (= (and (> 10 tptp.a) (<= 0 tptp.a)) (and (not (>= tptp.a 10)) (>= tptp.a 0)))) :rule cong :premises (t28 t29))
% 0.47/0.65  (step t31 (cl (= (or (= tptp.a 9) (= tptp.a 8) (= tptp.a 7) (= tptp.a 6) (= tptp.a 5) (= tptp.a 4) (= tptp.a 3) (= tptp.a 2) (= tptp.a 1) (= tptp.a 0)) (or (= tptp.a 9) (= tptp.a 8) (= tptp.a 7) (= tptp.a 6) (= tptp.a 5) (= tptp.a 4) (= tptp.a 3) (= tptp.a 2) (= tptp.a 1) (= tptp.a 0)))) :rule refl)
% 0.47/0.65  (step t32 (cl (= (= (and (> 10 tptp.a) (<= 0 tptp.a)) (or (= tptp.a 9) (= tptp.a 8) (= tptp.a 7) (= tptp.a 6) (= tptp.a 5) (= tptp.a 4) (= tptp.a 3) (= tptp.a 2) (= tptp.a 1) (= tptp.a 0))) (= (and (not (>= tptp.a 10)) (>= tptp.a 0)) (or (= tptp.a 9) (= tptp.a 8) (= tptp.a 7) (= tptp.a 6) (= tptp.a 5) (= tptp.a 4) (= tptp.a 3) (= tptp.a 2) (= tptp.a 1) (= tptp.a 0))))) :rule cong :premises (t30 t31))
% 0.47/0.65  (step t33 (cl (= (= (and (not (>= tptp.a 10)) (>= tptp.a 0)) (or (= tptp.a 9) (= tptp.a 8) (= tptp.a 7) (= tptp.a 6) (= tptp.a 5) (= tptp.a 4) (= tptp.a 3) (= tptp.a 2) (= tptp.a 1) (= tptp.a 0))) (= (or (= tptp.a 9) (= tptp.a 8) (= tptp.a 7) (= tptp.a 6) (= tptp.a 5) (= tptp.a 4) (= tptp.a 3) (= tptp.a 2) (= tptp.a 1) (= tptp.a 0)) (and (not (>= tptp.a 10)) (>= tptp.a 0))))) :rule all_simplify)
% 0.47/0.65  (step t34 (cl (= (= (and (> 10 tptp.a) (<= 0 tptp.a)) (or (= tptp.a 9) (= tptp.a 8) (= tptp.a 7) (= tptp.a 6) (= tptp.a 5) (= tptp.a 4) (= tptp.a 3) (= tptp.a 2) (= tptp.a 1) (= tptp.a 0))) (= (or (= tptp.a 9) (= tptp.a 8) (= tptp.a 7) (= tptp.a 6) (= tptp.a 5) (= tptp.a 4) (= tptp.a 3) (= tptp.a 2) (= tptp.a 1) (= tptp.a 0)) (and (not (>= tptp.a 10)) (>= tptp.a 0))))) :rule trans :premises (t32 t33))
% 0.47/0.65  (step t35 (cl (= (not (= (and (> 10 tptp.a) (<= 0 tptp.a)) (or (= tptp.a 9) (= tptp.a 8) (= tptp.a 7) (= tptp.a 6) (= tptp.a 5) (= tptp.a 4) (= tptp.a 3) (= tptp.a 2) (= tptp.a 1) (= tptp.a 0)))) (not (= (or (= tptp.a 9) (= tptp.a 8) (= tptp.a 7) (= tptp.a 6) (= tptp.a 5) (= tptp.a 4) (= tptp.a 3) (= tptp.a 2) (= tptp.a 1) (= tptp.a 0)) (and (not (>= tptp.a 10)) (>= tptp.a 0)))))) :rule cong :premises (t34))
% 0.47/0.65  (step t36 (cl (not (= (or (= tptp.a 9) (= tptp.a 8) (= tptp.a 7) (= tptp.a 6) (= tptp.a 5) (= tptp.a 4) (= tptp.a 3) (= tptp.a 2) (= tptp.a 1) (= tptp.a 0)) (and (not (>= tptp.a 10)) (>= tptp.a 0))))) :rule resolution :premises (t24 t35 a0))
% 0.47/0.65  (step t37 (cl (not (or (= tptp.a 9) (= tptp.a 8) (= tptp.a 7) (= tptp.a 6) (= tptp.a 5) (= tptp.a 4) (= tptp.a 3) (= tptp.a 2) (= tptp.a 1) (= tptp.a 0))) (not (and (not (>= tptp.a 10)) (>= tptp.a 0)))) :rule not_equiv2 :premises (t36))
% 0.47/0.65  (step t38 (cl (or (= tptp.a 9) (= tptp.a 8) (= tptp.a 7) (= tptp.a 6) (= tptp.a 5) (= tptp.a 4) (= tptp.a 3) (= tptp.a 2) (= tptp.a 1) (= tptp.a 0)) (not (= tptp.a 9))) :rule or_neg)
% 0.47/0.65  (step t39 (cl (not (= (or (not (not (>= tptp.a 10))) (not (>= tptp.a 0)) (not (not (= tptp.a 9))) (not (not (= tptp.a 8))) (not (not (= tptp.a 7))) (not (not (= tptp.a 6))) (not (not (= tptp.a 5))) (not (not (= tptp.a 4))) (not (not (= tptp.a 3))) (not (not (= tptp.a 2))) (not (not (= tptp.a 1))) (not (not (= tptp.a 0)))) (or (>= tptp.a 10) (not (>= tptp.a 0)) (= tptp.a 9) (= tptp.a 8) (= tptp.a 7) (= tptp.a 6) (= tptp.a 5) (= tptp.a 4) (= tptp.a 3) (= tptp.a 2) (= tptp.a 1) (= tptp.a 0)))) (not (or (not (not (>= tptp.a 10))) (not (>= tptp.a 0)) (not (not (= tptp.a 9))) (not (not (= tptp.a 8))) (not (not (= tptp.a 7))) (not (not (= tptp.a 6))) (not (not (= tptp.a 5))) (not (not (= tptp.a 4))) (not (not (= tptp.a 3))) (not (not (= tptp.a 2))) (not (not (= tptp.a 1))) (not (not (= tptp.a 0))))) (or (>= tptp.a 10) (not (>= tptp.a 0)) (= tptp.a 9) (= tptp.a 8) (= tptp.a 7) (= tptp.a 6) (= tptp.a 5) (= tptp.a 4) (= tptp.a 3) (= tptp.a 2) (= tptp.a 1) (= tptp.a 0))) :rule equiv_pos2)
% 0.47/0.65  (step t40 (cl (= (= (= (not (not (= tptp.a 9))) (= tptp.a 9)) true) (= (not (not (= tptp.a 9))) (= tptp.a 9)))) :rule equiv_simplify)
% 0.47/0.65  (step t41 (cl (not (= (= (not (not (= tptp.a 9))) (= tptp.a 9)) true)) (= (not (not (= tptp.a 9))) (= tptp.a 9))) :rule equiv1 :premises (t40))
% 0.47/0.65  (step t42 (cl (= (= (not (not (= tptp.a 9))) (= tptp.a 9)) (= (= tptp.a 9) (not (not (= tptp.a 9)))))) :rule all_simplify)
% 0.47/0.65  (step t43 (cl (= (= tptp.a 9) (= tptp.a 9))) :rule refl)
% 0.47/0.65  (step t44 (cl (= (not (not (= tptp.a 9))) (= tptp.a 9))) :rule all_simplify)
% 0.47/0.65  (step t45 (cl (= (= (= tptp.a 9) (not (not (= tptp.a 9)))) (= (= tptp.a 9) (= tptp.a 9)))) :rule cong :premises (t43 t44))
% 0.47/0.65  (step t46 (cl (= (= (= tptp.a 9) (= tptp.a 9)) true)) :rule all_simplify)
% 0.47/0.65  (step t47 (cl (= (= (= tptp.a 9) (not (not (= tptp.a 9)))) true)) :rule trans :premises (t45 t46))
% 0.47/0.65  (step t48 (cl (= (= (not (not (= tptp.a 9))) (= tptp.a 9)) true)) :rule trans :premises (t42 t47))
% 0.47/0.65  (step t49 (cl (= (not (not (= tptp.a 9))) (= tptp.a 9))) :rule resolution :premises (t41 t48))
% 0.47/0.65  (step t50 (cl (= (= (= (not (not (= tptp.a 8))) (= tptp.a 8)) true) (= (not (not (= tptp.a 8))) (= tptp.a 8)))) :rule equiv_simplify)
% 0.47/0.65  (step t51 (cl (not (= (= (not (not (= tptp.a 8))) (= tptp.a 8)) true)) (= (not (not (= tptp.a 8))) (= tptp.a 8))) :rule equiv1 :premises (t50))
% 0.47/0.65  (step t52 (cl (= (= (not (not (= tptp.a 8))) (= tptp.a 8)) (= (= tptp.a 8) (not (not (= tptp.a 8)))))) :rule all_simplify)
% 0.47/0.65  (step t53 (cl (= (= tptp.a 8) (= tptp.a 8))) :rule refl)
% 0.47/0.65  (step t54 (cl (= (not (not (= tptp.a 8))) (= tptp.a 8))) :rule all_simplify)
% 0.47/0.65  (step t55 (cl (= (= (= tptp.a 8) (not (not (= tptp.a 8)))) (= (= tptp.a 8) (= tptp.a 8)))) :rule cong :premises (t53 t54))
% 0.47/0.65  (step t56 (cl (= (= (= tptp.a 8) (= tptp.a 8)) true)) :rule all_simplify)
% 0.47/0.65  (step t57 (cl (= (= (= tptp.a 8) (not (not (= tptp.a 8)))) true)) :rule trans :premises (t55 t56))
% 0.47/0.65  (step t58 (cl (= (= (not (not (= tptp.a 8))) (= tptp.a 8)) true)) :rule trans :premises (t52 t57))
% 0.47/0.65  (step t59 (cl (= (not (not (= tptp.a 8))) (= tptp.a 8))) :rule resolution :premises (t51 t58))
% 0.47/0.65  (step t60 (cl (= (= (= (not (not (= tptp.a 7))) (= tptp.a 7)) true) (= (not (not (= tptp.a 7))) (= tptp.a 7)))) :rule equiv_simplify)
% 0.47/0.65  (step t61 (cl (not (= (= (not (not (= tptp.a 7))) (= tptp.a 7)) true)) (= (not (not (= tptp.a 7))) (= tptp.a 7))) :rule equiv1 :premises (t60))
% 0.47/0.65  (step t62 (cl (= (= (not (not (= tptp.a 7))) (= tptp.a 7)) (= (= tptp.a 7) (not (not (= tptp.a 7)))))) :rule all_simplify)
% 0.47/0.65  (step t63 (cl (= (= tptp.a 7) (= tptp.a 7))) :rule refl)
% 0.47/0.65  (step t64 (cl (= (not (not (= tptp.a 7))) (= tptp.a 7))) :rule all_simplify)
% 0.47/0.65  (step t65 (cl (= (= (= tptp.a 7) (not (not (= tptp.a 7)))) (= (= tptp.a 7) (= tptp.a 7)))) :rule cong :premises (t63 t64))
% 0.47/0.65  (step t66 (cl (= (= (= tptp.a 7) (= tptp.a 7)) true)) :rule all_simplify)
% 0.47/0.65  (step t67 (cl (= (= (= tptp.a 7) (not (not (= tptp.a 7)))) true)) :rule trans :premises (t65 t66))
% 0.47/0.65  (step t68 (cl (= (= (not (not (= tptp.a 7))) (= tptp.a 7)) true)) :rule trans :premises (t62 t67))
% 0.47/0.65  (step t69 (cl (= (not (not (= tptp.a 7))) (= tptp.a 7))) :rule resolution :premises (t61 t68))
% 0.47/0.65  (step t70 (cl (= (= (= (not (not (= tptp.a 6))) (= tptp.a 6)) true) (= (not (not (= tptp.a 6))) (= tptp.a 6)))) :rule equiv_simplify)
% 0.47/0.65  (step t71 (cl (not (= (= (not (not (= tptp.a 6))) (= tptp.a 6)) true)) (= (not (not (= tptp.a 6))) (= tptp.a 6))) :rule equiv1 :premises (t70))
% 0.47/0.65  (step t72 (cl (= (= (not (not (= tptp.a 6))) (= tptp.a 6)) (= (= tptp.a 6) (not (not (= tptp.a 6)))))) :rule all_simplify)
% 0.47/0.65  (step t73 (cl (= (= tptp.a 6) (= tptp.a 6))) :rule refl)
% 0.47/0.65  (step t74 (cl (= (not (not (= tptp.a 6))) (= tptp.a 6))) :rule all_simplify)
% 0.47/0.65  (step t75 (cl (= (= (= tptp.a 6) (not (not (= tptp.a 6)))) (= (= tptp.a 6) (= tptp.a 6)))) :rule cong :premises (t73 t74))
% 0.47/0.65  (step t76 (cl (= (= (= tptp.a 6) (= tptp.a 6)) true)) :rule all_simplify)
% 0.47/0.65  (step t77 (cl (= (= (= tptp.a 6) (not (not (= tptp.a 6)))) true)) :rule trans :premises (t75 t76))
% 0.47/0.65  (step t78 (cl (= (= (not (not (= tptp.a 6))) (= tptp.a 6)) true)) :rule trans :premises (t72 t77))
% 0.47/0.65  (step t79 (cl (= (not (not (= tptp.a 6))) (= tptp.a 6))) :rule resolution :premises (t71 t78))
% 0.47/0.65  (step t80 (cl (= (= (= (not (not (= tptp.a 5))) (= tptp.a 5)) true) (= (not (not (= tptp.a 5))) (= tptp.a 5)))) :rule equiv_simplify)
% 0.47/0.65  (step t81 (cl (not (= (= (not (not (= tptp.a 5))) (= tptp.a 5)) true)) (= (not (not (= tptp.a 5))) (= tptp.a 5))) :rule equiv1 :premises (t80))
% 0.47/0.65  (step t82 (cl (= (= (not (not (= tptp.a 5))) (= tptp.a 5)) (= (= tptp.a 5) (not (not (= tptp.a 5)))))) :rule all_simplify)
% 0.47/0.65  (step t83 (cl (= (= tptp.a 5) (= tptp.a 5))) :rule refl)
% 0.47/0.65  (step t84 (cl (= (not (not (= tptp.a 5))) (= tptp.a 5))) :rule all_simplify)
% 0.47/0.65  (step t85 (cl (= (= (= tptp.a 5) (not (not (= tptp.a 5)))) (= (= tptp.a 5) (= tptp.a 5)))) :rule cong :premises (t83 t84))
% 0.47/0.65  (step t86 (cl (= (= (= tptp.a 5) (= tptp.a 5)) true)) :rule all_simplify)
% 0.47/0.65  (step t87 (cl (= (= (= tptp.a 5) (not (not (= tptp.a 5)))) true)) :rule trans :premises (t85 t86))
% 0.47/0.65  (step t88 (cl (= (= (not (not (= tptp.a 5))) (= tptp.a 5)) true)) :rule trans :premises (t82 t87))
% 0.47/0.65  (step t89 (cl (= (not (not (= tptp.a 5))) (= tptp.a 5))) :rule resolution :premises (t81 t88))
% 0.47/0.65  (step t90 (cl (= (= (= (not (not (= tptp.a 4))) (= tptp.a 4)) true) (= (not (not (= tptp.a 4))) (= tptp.a 4)))) :rule equiv_simplify)
% 0.47/0.65  (step t91 (cl (not (= (= (not (not (= tptp.a 4))) (= tptp.a 4)) true)) (= (not (not (= tptp.a 4))) (= tptp.a 4))) :rule equiv1 :premises (t90))
% 0.47/0.65  (step t92 (cl (= (= (not (not (= tptp.a 4))) (= tptp.a 4)) (= (= tptp.a 4) (not (not (= tptp.a 4)))))) :rule all_simplify)
% 0.47/0.65  (step t93 (cl (= (= tptp.a 4) (= tptp.a 4))) :rule refl)
% 0.47/0.65  (step t94 (cl (= (not (not (= tptp.a 4))) (= tptp.a 4))) :rule all_simplify)
% 0.47/0.65  (step t95 (cl (= (= (= tptp.a 4) (not (not (= tptp.a 4)))) (= (= tptp.a 4) (= tptp.a 4)))) :rule cong :premises (t93 t94))
% 0.47/0.65  (step t96 (cl (= (= (= tptp.a 4) (= tptp.a 4)) true)) :rule all_simplify)
% 0.47/0.65  (step t97 (cl (= (= (= tptp.a 4) (not (not (= tptp.a 4)))) true)) :rule trans :premises (t95 t96))
% 0.47/0.65  (step t98 (cl (= (= (not (not (= tptp.a 4))) (= tptp.a 4)) true)) :rule trans :premises (t92 t97))
% 0.47/0.65  (step t99 (cl (= (not (not (= tptp.a 4))) (= tptp.a 4))) :rule resolution :premises (t91 t98))
% 0.47/0.65  (step t100 (cl (= (= (= (not (not (= tptp.a 3))) (= tptp.a 3)) true) (= (not (not (= tptp.a 3))) (= tptp.a 3)))) :rule equiv_simplify)
% 0.47/0.65  (step t101 (cl (not (= (= (not (not (= tptp.a 3))) (= tptp.a 3)) true)) (= (not (not (= tptp.a 3))) (= tptp.a 3))) :rule equiv1 :premises (t100))
% 0.47/0.65  (step t102 (cl (= (= (not (not (= tptp.a 3))) (= tptp.a 3)) (= (= tptp.a 3) (not (not (= tptp.a 3)))))) :rule all_simplify)
% 0.47/0.65  (step t103 (cl (= (= tptp.a 3) (= tptp.a 3))) :rule refl)
% 0.47/0.65  (step t104 (cl (= (not (not (= tptp.a 3))) (= tptp.a 3))) :rule all_simplify)
% 0.47/0.65  (step t105 (cl (= (= (= tptp.a 3) (not (not (= tptp.a 3)))) (= (= tptp.a 3) (= tptp.a 3)))) :rule cong :premises (t103 t104))
% 0.47/0.65  (step t106 (cl (= (= (= tptp.a 3) (= tptp.a 3)) true)) :rule all_simplify)
% 0.47/0.65  (step t107 (cl (= (= (= tptp.a 3) (not (not (= tptp.a 3)))) true)) :rule trans :premises (t105 t106))
% 0.47/0.65  (step t108 (cl (= (= (not (not (= tptp.a 3))) (= tptp.a 3)) true)) :rule trans :premises (t102 t107))
% 0.47/0.65  (step t109 (cl (= (not (not (= tptp.a 3))) (= tptp.a 3))) :rule resolution :premises (t101 t108))
% 0.47/0.65  (step t110 (cl (= (= (= (not (not (= tptp.a 2))) (= tptp.a 2)) true) (= (not (not (= tptp.a 2))) (= tptp.a 2)))) :rule equiv_simplify)
% 0.47/0.65  (step t111 (cl (not (= (= (not (not (= tptp.a 2))) (= tptp.a 2)) true)) (= (not (not (= tptp.a 2))) (= tptp.a 2))) :rule equiv1 :premises (t110))
% 0.47/0.65  (step t112 (cl (= (= (not (not (= tptp.a 2))) (= tptp.a 2)) (= (= tptp.a 2) (not (not (= tptp.a 2)))))) :rule all_simplify)
% 0.47/0.65  (step t113 (cl (= (= tptp.a 2) (= tptp.a 2))) :rule refl)
% 0.47/0.65  (step t114 (cl (= (not (not (= tptp.a 2))) (= tptp.a 2))) :rule all_simplify)
% 0.47/0.65  (step t115 (cl (= (= (= tptp.a 2) (not (not (= tptp.a 2)))) (= (= tptp.a 2) (= tptp.a 2)))) :rule cong :premises (t113 t114))
% 0.47/0.65  (step t116 (cl (= (= (= tptp.a 2) (= tptp.a 2)) true)) :rule all_simplify)
% 0.47/0.65  (step t117 (cl (= (= (= tptp.a 2) (not (not (= tptp.a 2)))) true)) :rule trans :premises (t115 t116))
% 0.47/0.65  (step t118 (cl (= (= (not (not (= tptp.a 2))) (= tptp.a 2)) true)) :rule trans :premises (t112 t117))
% 0.47/0.65  (step t119 (cl (= (not (not (= tptp.a 2))) (= tptp.a 2))) :rule resolution :premises (t111 t118))
% 0.47/0.65  (step t120 (cl (= (= (= (not (not (= tptp.a 1))) (= tptp.a 1)) true) (= (not (not (= tptp.a 1))) (= tptp.a 1)))) :rule equiv_simplify)
% 0.47/0.65  (step t121 (cl (not (= (= (not (not (= tptp.a 1))) (= tptp.a 1)) true)) (= (not (not (= tptp.a 1))) (= tptp.a 1))) :rule equiv1 :premises (t120))
% 0.47/0.65  (step t122 (cl (= (= (not (not (= tptp.a 1))) (= tptp.a 1)) (= (= tptp.a 1) (not (not (= tptp.a 1)))))) :rule all_simplify)
% 0.47/0.65  (step t123 (cl (= (= tptp.a 1) (= tptp.a 1))) :rule refl)
% 0.47/0.65  (step t124 (cl (= (not (not (= tptp.a 1))) (= tptp.a 1))) :rule all_simplify)
% 0.47/0.65  (step t125 (cl (= (= (= tptp.a 1) (not (not (= tptp.a 1)))) (= (= tptp.a 1) (= tptp.a 1)))) :rule cong :premises (t123 t124))
% 0.47/0.65  (step t126 (cl (= (= (= tptp.a 1) (= tptp.a 1)) true)) :rule all_simplify)
% 0.47/0.65  (step t127 (cl (= (= (= tptp.a 1) (not (not (= tptp.a 1)))) true)) :rule trans :premises (t125 t126))
% 0.47/0.65  (step t128 (cl (= (= (not (not (= tptp.a 1))) (= tptp.a 1)) true)) :rule trans :premises (t122 t127))
% 0.47/0.65  (step t129 (cl (= (not (not (= tptp.a 1))) (= tptp.a 1))) :rule resolution :premises (t121 t128))
% 0.47/0.65  (step t130 (cl (= (= (= (not (not (= tptp.a 0))) (= tptp.a 0)) true) (= (not (not (= tptp.a 0))) (= tptp.a 0)))) :rule equiv_simplify)
% 0.47/0.65  (step t131 (cl (not (= (= (not (not (= tptp.a 0))) (= tptp.a 0)) true)) (= (not (not (= tptp.a 0))) (= tptp.a 0))) :rule equiv1 :premises (t130))
% 0.47/0.65  (step t132 (cl (= (= (not (not (= tptp.a 0))) (= tptp.a 0)) (= (= tptp.a 0) (not (not (= tptp.a 0)))))) :rule all_simplify)
% 0.47/0.65  (step t133 (cl (= (= tptp.a 0) (= tptp.a 0))) :rule refl)
% 0.47/0.65  (step t134 (cl (= (not (not (= tptp.a 0))) (= tptp.a 0))) :rule all_simplify)
% 0.47/0.65  (step t135 (cl (= (= (= tptp.a 0) (not (not (= tptp.a 0)))) (= (= tptp.a 0) (= tptp.a 0)))) :rule cong :premises (t133 t134))
% 0.47/0.65  (step t136 (cl (= (= (= tptp.a 0) (= tptp.a 0)) true)) :rule all_simplify)
% 0.47/0.65  (step t137 (cl (= (= (= tptp.a 0) (not (not (= tptp.a 0)))) true)) :rule trans :premises (t135 t136))
% 0.47/0.65  (step t138 (cl (= (= (not (not (= tptp.a 0))) (= tptp.a 0)) true)) :rule trans :premises (t132 t137))
% 0.47/0.65  (step t139 (cl (= (not (not (= tptp.a 0))) (= tptp.a 0))) :rule resolution :premises (t131 t138))
% 0.47/0.65  (step t140 (cl (= (or (not (not (>= tptp.a 10))) (not (>= tptp.a 0)) (not (not (= tptp.a 9))) (not (not (= tptp.a 8))) (not (not (= tptp.a 7))) (not (not (= tptp.a 6))) (not (not (= tptp.a 5))) (not (not (= tptp.a 4))) (not (not (= tptp.a 3))) (not (not (= tptp.a 2))) (not (not (= tptp.a 1))) (not (not (= tptp.a 0)))) (or (>= tptp.a 10) (not (>= tptp.a 0)) (= tptp.a 9) (= tptp.a 8) (= tptp.a 7) (= tptp.a 6) (= tptp.a 5) (= tptp.a 4) (= tptp.a 3) (= tptp.a 2) (= tptp.a 1) (= tptp.a 0)))) :rule cong :premises (t12 t13 t49 t59 t69 t79 t89 t99 t109 t119 t129 t139))
% 0.47/0.65  (step t141 (cl (not (= (=> (and (not (>= tptp.a 10)) (>= tptp.a 0) (not (= tptp.a 9)) (not (= tptp.a 8)) (not (= tptp.a 7)) (not (= tptp.a 6)) (not (= tptp.a 5)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (not (= tptp.a 0))) (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0)))) (not (and (not (>= tptp.a 10)) (>= tptp.a 0) (not (= tptp.a 9)) (not (= tptp.a 8)) (not (= tptp.a 7)) (not (= tptp.a 6)) (not (= tptp.a 5)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (not (= tptp.a 0)))))) (not (=> (and (not (>= tptp.a 10)) (>= tptp.a 0) (not (= tptp.a 9)) (not (= tptp.a 8)) (not (= tptp.a 7)) (not (= tptp.a 6)) (not (= tptp.a 5)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (not (= tptp.a 0))) (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0))))) (not (and (not (>= tptp.a 10)) (>= tptp.a 0) (not (= tptp.a 9)) (not (= tptp.a 8)) (not (= tptp.a 7)) (not (= tptp.a 6)) (not (= tptp.a 5)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (not (= tptp.a 0))))) :rule equiv_pos2)
% 0.47/0.65  (step t142 (cl (= (and (not (>= tptp.a 10)) (>= tptp.a 0) (not (= tptp.a 9)) (not (= tptp.a 8)) (not (= tptp.a 7)) (not (= tptp.a 6)) (not (= tptp.a 5)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (not (= tptp.a 0))) (and (not (>= tptp.a 10)) (>= tptp.a 0) (not (= tptp.a 9)) (not (= tptp.a 8)) (not (= tptp.a 7)) (not (= tptp.a 6)) (not (= tptp.a 5)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (not (= tptp.a 0))))) :rule refl)
% 0.47/0.65  (step t143 (cl (= (= (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0))) false) (not (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0)))))) :rule equiv_simplify)
% 0.47/0.65  (step t144 (cl (= (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0))) false) (not (not (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0)))))) :rule equiv2 :premises (t143))
% 0.47/0.65  (step t145 (cl (not (not (not (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0)))))) (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0)))) :rule not_not)
% 0.47/0.65  (step t146 (cl (= (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0))) false) (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0)))) :rule resolution :premises (t144 t145))
% 0.47/0.65  (step t147 (cl (=> (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0))) false) (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0)))) :rule implies_neg1)
% 0.47/0.65  (anchor :step t148)
% 0.47/0.65  (assume t148.a0 (not (= tptp.a 5)))
% 0.47/0.65  (assume t148.a1 (not (= tptp.a 6)))
% 0.47/0.65  (assume t148.a2 (not (= tptp.a 7)))
% 0.47/0.65  (assume t148.a3 (not (= tptp.a 8)))
% 0.47/0.65  (assume t148.a4 (not (= tptp.a 9)))
% 0.47/0.65  (assume t148.a5 (not (>= tptp.a 10)))
% 0.47/0.65  (assume t148.a6 (not (= tptp.a 4)))
% 0.47/0.65  (assume t148.a7 (not (= tptp.a 3)))
% 0.47/0.65  (assume t148.a8 (not (= tptp.a 2)))
% 0.47/0.65  (assume t148.a9 (not (= tptp.a 1)))
% 0.47/0.65  (assume t148.a10 (>= tptp.a 0))
% 0.47/0.65  (assume t148.a11 (not (= tptp.a 0)))
% 0.47/0.65  (step t148.t1 (cl (or (= tptp.a 4) (not (<= tptp.a 4)) (not (<= 4 tptp.a)))) :rule la_disequality)
% 0.47/0.66  (step t148.t2 (cl (= tptp.a 4) (not (<= tptp.a 4)) (not (<= 4 tptp.a))) :rule or :premises (t148.t1))
% 0.47/0.66  (step t148.t3 (cl (not (= (>= tptp.a 4) (<= 4 tptp.a))) (not (>= tptp.a 4)) (<= 4 tptp.a)) :rule equiv_pos2)
% 0.47/0.66  (step t148.t4 (cl (= (>= tptp.a 4) (<= 4 tptp.a))) :rule comp_simplify)
% 0.47/0.66  (step t148.t5 (cl (not (> tptp.a 3)) (>= tptp.a 4)) :rule la_generic :args (1 1))
% 0.47/0.66  (step t148.t6 (cl (or (= tptp.a 3) (not (<= tptp.a 3)) (not (<= 3 tptp.a)))) :rule la_disequality)
% 0.47/0.66  (step t148.t7 (cl (= tptp.a 3) (not (<= tptp.a 3)) (not (<= 3 tptp.a))) :rule or :premises (t148.t6))
% 0.47/0.66  (step t148.t8 (cl (not (= (>= tptp.a 3) (<= 3 tptp.a))) (not (>= tptp.a 3)) (<= 3 tptp.a)) :rule equiv_pos2)
% 0.47/0.66  (step t148.t9 (cl (= (>= tptp.a 3) (<= 3 tptp.a))) :rule comp_simplify)
% 0.47/0.66  (step t148.t10 (cl (not (> tptp.a 2)) (>= tptp.a 3)) :rule la_generic :args (1 1))
% 0.47/0.66  (step t148.t11 (cl (or (= tptp.a 2) (not (<= tptp.a 2)) (not (<= 2 tptp.a)))) :rule la_disequality)
% 0.47/0.66  (step t148.t12 (cl (= tptp.a 2) (not (<= tptp.a 2)) (not (<= 2 tptp.a))) :rule or :premises (t148.t11))
% 0.47/0.66  (step t148.t13 (cl (not (= (>= tptp.a 2) (<= 2 tptp.a))) (not (>= tptp.a 2)) (<= 2 tptp.a)) :rule equiv_pos2)
% 0.47/0.66  (step t148.t14 (cl (= (>= tptp.a 2) (<= 2 tptp.a))) :rule comp_simplify)
% 0.47/0.66  (step t148.t15 (cl (not (> tptp.a 1)) (>= tptp.a 2)) :rule la_generic :args (1 1))
% 0.47/0.66  (step t148.t16 (cl (or (= tptp.a 1) (not (<= tptp.a 1)) (not (<= 1 tptp.a)))) :rule la_disequality)
% 0.47/0.66  (step t148.t17 (cl (= tptp.a 1) (not (<= tptp.a 1)) (not (<= 1 tptp.a))) :rule or :premises (t148.t16))
% 0.47/0.66  (step t148.t18 (cl (not (= (>= tptp.a 1) (<= 1 tptp.a))) (not (>= tptp.a 1)) (<= 1 tptp.a)) :rule equiv_pos2)
% 0.47/0.66  (step t148.t19 (cl (= (>= tptp.a 1) (<= 1 tptp.a))) :rule comp_simplify)
% 0.47/0.66  (step t148.t20 (cl (not (> tptp.a 0)) (>= tptp.a 1)) :rule la_generic :args (1 1))
% 0.47/0.66  (step t148.t21 (cl (or (= tptp.a 0) (not (<= tptp.a 0)) (not (<= 0 tptp.a)))) :rule la_disequality)
% 0.47/0.66  (step t148.t22 (cl (= tptp.a 0) (not (<= tptp.a 0)) (not (<= 0 tptp.a))) :rule or :premises (t148.t21))
% 0.47/0.66  (step t148.t23 (cl (not (= (>= tptp.a 0) (<= 0 tptp.a))) (not (>= tptp.a 0)) (<= 0 tptp.a)) :rule equiv_pos2)
% 0.47/0.66  (step t148.t24 (cl (= (>= tptp.a 0) (<= 0 tptp.a))) :rule comp_simplify)
% 0.47/0.66  (step t148.t25 (cl (<= 0 tptp.a)) :rule resolution :premises (t148.t23 t148.t24 t148.a10))
% 0.47/0.66  (step t148.t26 (cl (not (<= tptp.a 0))) :rule resolution :premises (t148.t22 t148.t25 t148.a11))
% 0.47/0.66  (step t148.t27 (cl (not (= (> tptp.a 0) (not (<= tptp.a 0)))) (> tptp.a 0) (not (not (<= tptp.a 0)))) :rule equiv_pos1)
% 0.47/0.66  (step t148.t28 (cl (= (> tptp.a 0) (not (<= tptp.a 0)))) :rule comp_simplify)
% 0.47/0.66  (step t148.t29 (cl (> tptp.a 0)) :rule resolution :premises (t148.t26 t148.t27 t148.t28))
% 0.47/0.66  (step t148.t30 (cl (>= tptp.a 1)) :rule resolution :premises (t148.t20 t148.t29))
% 0.47/0.66  (step t148.t31 (cl (<= 1 tptp.a)) :rule resolution :premises (t148.t18 t148.t19 t148.t30))
% 0.47/0.66  (step t148.t32 (cl (not (<= tptp.a 1))) :rule resolution :premises (t148.t17 t148.t31 t148.a9))
% 0.47/0.66  (step t148.t33 (cl (not (= (> tptp.a 1) (not (<= tptp.a 1)))) (> tptp.a 1) (not (not (<= tptp.a 1)))) :rule equiv_pos1)
% 0.47/0.66  (step t148.t34 (cl (= (> tptp.a 1) (not (<= tptp.a 1)))) :rule comp_simplify)
% 0.47/0.66  (step t148.t35 (cl (> tptp.a 1)) :rule resolution :premises (t148.t32 t148.t33 t148.t34))
% 0.47/0.66  (step t148.t36 (cl (>= tptp.a 2)) :rule resolution :premises (t148.t15 t148.t35))
% 0.47/0.66  (step t148.t37 (cl (<= 2 tptp.a)) :rule resolution :premises (t148.t13 t148.t14 t148.t36))
% 0.47/0.66  (step t148.t38 (cl (not (<= tptp.a 2))) :rule resolution :premises (t148.t12 t148.t37 t148.a8))
% 0.47/0.66  (step t148.t39 (cl (not (= (> tptp.a 2) (not (<= tptp.a 2)))) (> tptp.a 2) (not (not (<= tptp.a 2)))) :rule equiv_pos1)
% 0.47/0.66  (step t148.t40 (cl (= (> tptp.a 2) (not (<= tptp.a 2)))) :rule comp_simplify)
% 0.47/0.66  (step t148.t41 (cl (> tptp.a 2)) :rule resolution :premises (t148.t38 t148.t39 t148.t40))
% 0.47/0.66  (step t148.t42 (cl (>= tptp.a 3)) :rule resolution :premises (t148.t10 t148.t41))
% 0.47/0.66  (step t148.t43 (cl (<= 3 tptp.a)) :rule resolution :premises (t148.t8 t148.t9 t148.t42))
% 0.47/0.66  (step t148.t44 (cl (not (<= tptp.a 3))) :rule resolution :premises (t148.t7 t148.t43 t148.a7))
% 0.47/0.66  (step t148.t45 (cl (not (= (> tptp.a 3) (not (<= tptp.a 3)))) (> tptp.a 3) (not (not (<= tptp.a 3)))) :rule equiv_pos1)
% 0.47/0.66  (step t148.t46 (cl (= (> tptp.a 3) (not (<= tptp.a 3)))) :rule comp_simplify)
% 0.47/0.66  (step t148.t47 (cl (> tptp.a 3)) :rule resolution :premises (t148.t44 t148.t45 t148.t46))
% 0.47/0.66  (step t148.t48 (cl (>= tptp.a 4)) :rule resolution :premises (t148.t5 t148.t47))
% 0.47/0.66  (step t148.t49 (cl (<= 4 tptp.a)) :rule resolution :premises (t148.t3 t148.t4 t148.t48))
% 0.47/0.66  (step t148.t50 (cl (not (<= tptp.a 4))) :rule resolution :premises (t148.t2 t148.t49 t148.a6))
% 0.47/0.66  (step t148.t51 (cl (not (= (> tptp.a 4) (not (<= tptp.a 4)))) (> tptp.a 4) (not (not (<= tptp.a 4)))) :rule equiv_pos1)
% 0.47/0.66  (step t148.t52 (cl (= (> tptp.a 4) (not (<= tptp.a 4)))) :rule comp_simplify)
% 0.47/0.66  (step t148.t53 (cl (> tptp.a 4)) :rule resolution :premises (t148.t50 t148.t51 t148.t52))
% 0.47/0.66  (step t148.t54 (cl (not (= (<= tptp.a 4) (not (> tptp.a 4)))) (not (<= tptp.a 4)) (not (> tptp.a 4))) :rule equiv_pos2)
% 0.47/0.66  (step t148.t55 (cl (= (<= tptp.a 4) (not (>= tptp.a 5)))) :rule all_simplify)
% 0.47/0.66  (step t148.t56 (cl (= (> tptp.a 4) (not (<= tptp.a 4)))) :rule all_simplify)
% 0.47/0.66  (step t148.t57 (cl (= (not (<= tptp.a 4)) (not (not (>= tptp.a 5))))) :rule cong :premises (t148.t55))
% 0.47/0.66  (step t148.t58 (cl (= (not (not (>= tptp.a 5))) (>= tptp.a 5))) :rule all_simplify)
% 0.47/0.66  (step t148.t59 (cl (= (not (<= tptp.a 4)) (>= tptp.a 5))) :rule trans :premises (t148.t57 t148.t58))
% 0.47/0.66  (step t148.t60 (cl (= (> tptp.a 4) (>= tptp.a 5))) :rule trans :premises (t148.t56 t148.t59))
% 0.47/0.66  (step t148.t61 (cl (= (not (> tptp.a 4)) (not (>= tptp.a 5)))) :rule cong :premises (t148.t60))
% 0.47/0.66  (step t148.t62 (cl (= (not (>= tptp.a 5)) (not (> tptp.a 4)))) :rule symm :premises (t148.t61))
% 0.47/0.66  (step t148.t63 (cl (= (<= tptp.a 4) (not (> tptp.a 4)))) :rule trans :premises (t148.t55 t148.t62))
% 0.47/0.66  (step t148.t64 (cl (not (< tptp.a 5)) (<= tptp.a 4)) :rule la_generic :args (1 1))
% 0.47/0.66  (step t148.t65 (cl (or (= tptp.a 5) (not (<= tptp.a 5)) (not (<= 5 tptp.a)))) :rule la_disequality)
% 0.47/0.66  (step t148.t66 (cl (= tptp.a 5) (not (<= tptp.a 5)) (not (<= 5 tptp.a))) :rule or :premises (t148.t65))
% 0.47/0.66  (step t148.t67 (cl (not (< tptp.a 6)) (<= tptp.a 5)) :rule la_generic :args (1 1))
% 0.47/0.66  (step t148.t68 (cl (or (= tptp.a 6) (not (<= tptp.a 6)) (not (<= 6 tptp.a)))) :rule la_disequality)
% 0.47/0.66  (step t148.t69 (cl (= tptp.a 6) (not (<= tptp.a 6)) (not (<= 6 tptp.a))) :rule or :premises (t148.t68))
% 0.47/0.66  (step t148.t70 (cl (not (< tptp.a 7)) (<= tptp.a 6)) :rule la_generic :args (1 1))
% 0.47/0.66  (step t148.t71 (cl (or (= tptp.a 7) (not (<= tptp.a 7)) (not (<= 7 tptp.a)))) :rule la_disequality)
% 0.47/0.66  (step t148.t72 (cl (= tptp.a 7) (not (<= tptp.a 7)) (not (<= 7 tptp.a))) :rule or :premises (t148.t71))
% 0.47/0.66  (step t148.t73 (cl (not (< tptp.a 8)) (<= tptp.a 7)) :rule la_generic :args (1 1))
% 0.47/0.66  (step t148.t74 (cl (or (= tptp.a 8) (not (<= tptp.a 8)) (not (<= 8 tptp.a)))) :rule la_disequality)
% 0.47/0.66  (step t148.t75 (cl (= tptp.a 8) (not (<= tptp.a 8)) (not (<= 8 tptp.a))) :rule or :premises (t148.t74))
% 0.47/0.66  (step t148.t76 (cl (not (< tptp.a 9)) (<= tptp.a 8)) :rule la_generic :args (1 1))
% 0.47/0.66  (step t148.t77 (cl (or (= tptp.a 9) (not (<= tptp.a 9)) (not (<= 9 tptp.a)))) :rule la_disequality)
% 0.47/0.66  (step t148.t78 (cl (= tptp.a 9) (not (<= tptp.a 9)) (not (<= 9 tptp.a))) :rule or :premises (t148.t77))
% 0.47/0.66  (step t148.t79 (cl (not (< tptp.a 10)) (<= tptp.a 9)) :rule la_generic :args (1 1))
% 0.47/0.66  (step t148.t80 (cl (not (= (not (>= tptp.a 10)) (< tptp.a 10))) (not (not (>= tptp.a 10))) (< tptp.a 10)) :rule equiv_pos2)
% 0.47/0.66  (step t148.t81 (cl (= (< tptp.a 10) (not (>= tptp.a 10)))) :rule all_simplify)
% 0.47/0.66  (step t148.t82 (cl (= (not (>= tptp.a 10)) (< tptp.a 10))) :rule symm :premises (t148.t81))
% 0.47/0.66  (step t148.t83 (cl (< tptp.a 10)) :rule resolution :premises (t148.t80 t148.t82 t148.a5))
% 0.47/0.66  (step t148.t84 (cl (<= tptp.a 9)) :rule resolution :premises (t148.t79 t148.t83))
% 0.47/0.66  (step t148.t85 (cl (not (<= 9 tptp.a))) :rule resolution :premises (t148.t78 t148.a4 t148.t84))
% 0.47/0.66  (step t148.t86 (cl (not (= (< tptp.a 9) (not (<= 9 tptp.a)))) (< tptp.a 9) (not (not (<= 9 tptp.a)))) :rule equiv_pos1)
% 0.47/0.66  (step t148.t87 (cl (= (< tptp.a 9) (not (<= 9 tptp.a)))) :rule comp_simplify)
% 0.47/0.66  (step t148.t88 (cl (< tptp.a 9)) :rule resolution :premises (t148.t85 t148.t86 t148.t87))
% 0.47/0.66  (step t148.t89 (cl (<= tptp.a 8)) :rule resolution :premises (t148.t76 t148.t88))
% 0.47/0.66  (step t148.t90 (cl (not (<= 8 tptp.a))) :rule resolution :premises (t148.t75 t148.a3 t148.t89))
% 0.47/0.66  (step t148.t91 (cl (not (= (< tptp.a 8) (not (<= 8 tptp.a)))) (< tptp.a 8) (not (not (<= 8 tptp.a)))) :rule equiv_pos1)
% 0.47/0.66  (step t148.t92 (cl (= (< tptp.a 8) (not (<= 8 tptp.a)))) :rule comp_simplify)
% 0.47/0.66  (step t148.t93 (cl (< tptp.a 8)) :rule resolution :premises (t148.t90 t148.t91 t148.t92))
% 0.47/0.66  (step t148.t94 (cl (<= tptp.a 7)) :rule resolution :premises (t148.t73 t148.t93))
% 0.47/0.66  (step t148.t95 (cl (not (<= 7 tptp.a))) :rule resolution :premises (t148.t72 t148.a2 t148.t94))
% 0.47/0.66  (step t148.t96 (cl (not (= (< tptp.a 7) (not (<= 7 tptp.a)))) (< tptp.a 7) (not (not (<= 7 tptp.a)))) :rule equiv_pos1)
% 0.47/0.66  (step t148.t97 (cl (= (< tptp.a 7) (not (<= 7 tptp.a)))) :rule comp_simplify)
% 0.47/0.66  (step t148.t98 (cl (< tptp.a 7)) :rule resolution :premises (t148.t95 t148.t96 t148.t97))
% 0.47/0.66  (step t148.t99 (cl (<= tptp.a 6)) :rule resolution :premises (t148.t70 t148.t98))
% 0.47/0.66  (step t148.t100 (cl (not (<= 6 tptp.a))) :rule resolution :premises (t148.t69 t148.a1 t148.t99))
% 0.47/0.66  (step t148.t101 (cl (not (= (< tptp.a 6) (not (<= 6 tptp.a)))) (< tptp.a 6) (not (not (<= 6 tptp.a)))) :rule equiv_pos1)
% 0.47/0.66  (step t148.t102 (cl (= (< tptp.a 6) (not (<= 6 tptp.a)))) :rule comp_simplify)
% 0.47/0.66  (step t148.t103 (cl (< tptp.a 6)) :rule resolution :premises (t148.t100 t148.t101 t148.t102))
% 0.47/0.66  (step t148.t104 (cl (<= tptp.a 5)) :rule resolution :premises (t148.t67 t148.t103))
% 0.47/0.66  (step t148.t105 (cl (not (<= 5 tptp.a))) :rule resolution :premises (t148.t66 t148.a0 t148.t104))
% 0.47/0.66  (step t148.t106 (cl (not (= (< tptp.a 5) (not (<= 5 tptp.a)))) (< tptp.a 5) (not (not (<= 5 tptp.a)))) :rule equiv_pos1)
% 0.47/0.66  (step t148.t107 (cl (= (< tptp.a 5) (not (<= 5 tptp.a)))) :rule comp_simplify)
% 0.47/0.66  (step t148.t108 (cl (< tptp.a 5)) :rule resolution :premises (t148.t105 t148.t106 t148.t107))
% 0.47/0.66  (step t148.t109 (cl (<= tptp.a 4)) :rule resolution :premises (t148.t64 t148.t108))
% 0.47/0.66  (step t148.t110 (cl (not (> tptp.a 4))) :rule resolution :premises (t148.t54 t148.t63 t148.t109))
% 0.47/0.66  (step t148.t111 (cl) :rule resolution :premises (t148.t53 t148.t110))
% 0.47/0.66  (step t148 (cl (not (not (= tptp.a 5))) (not (not (= tptp.a 6))) (not (not (= tptp.a 7))) (not (not (= tptp.a 8))) (not (not (= tptp.a 9))) (not (not (>= tptp.a 10))) (not (not (= tptp.a 4))) (not (not (= tptp.a 3))) (not (not (= tptp.a 2))) (not (not (= tptp.a 1))) (not (>= tptp.a 0)) (not (not (= tptp.a 0))) false) :rule subproof :discharge (t148.a0 t148.a1 t148.a2 t148.a3 t148.a4 t148.a5 t148.a6 t148.a7 t148.a8 t148.a9 t148.a10 t148.a11))
% 0.47/0.66  (step t149 (cl (not (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0)))) (not (= tptp.a 5))) :rule and_pos)
% 0.47/0.66  (step t150 (cl (not (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0)))) (not (= tptp.a 6))) :rule and_pos)
% 0.47/0.66  (step t151 (cl (not (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0)))) (not (= tptp.a 7))) :rule and_pos)
% 0.47/0.66  (step t152 (cl (not (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0)))) (not (= tptp.a 8))) :rule and_pos)
% 0.47/0.66  (step t153 (cl (not (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0)))) (not (= tptp.a 9))) :rule and_pos)
% 0.47/0.66  (step t154 (cl (not (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0)))) (not (>= tptp.a 10))) :rule and_pos)
% 0.47/0.66  (step t155 (cl (not (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0)))) (not (= tptp.a 4))) :rule and_pos)
% 0.47/0.66  (step t156 (cl (not (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0)))) (not (= tptp.a 3))) :rule and_pos)
% 0.47/0.66  (step t157 (cl (not (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0)))) (not (= tptp.a 2))) :rule and_pos)
% 0.47/0.66  (step t158 (cl (not (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0)))) (not (= tptp.a 1))) :rule and_pos)
% 0.47/0.66  (step t159 (cl (not (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0)))) (>= tptp.a 0)) :rule and_pos)
% 0.47/0.66  (step t160 (cl (not (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0)))) (not (= tptp.a 0))) :rule and_pos)
% 0.47/0.66  (step t161 (cl false (not (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0)))) (not (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0)))) (not (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0)))) (not (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0)))) (not (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0)))) (not (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0)))) (not (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0)))) (not (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0)))) (not (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0)))) (not (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0)))) (not (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0)))) (not (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0))))) :rule resolution :premises (t148 t149 t150 t151 t152 t153 t154 t155 t156 t157 t158 t159 t160))
% 0.47/0.66  (step t162 (cl (not (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0)))) (not (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0)))) (not (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0)))) (not (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0)))) (not (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0)))) (not (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0)))) (not (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0)))) (not (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0)))) (not (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0)))) (not (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0)))) (not (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0)))) (not (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0)))) false) :rule reordering :premises (t161))
% 0.47/0.66  (step t163 (cl (not (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0)))) false) :rule contraction :premises (t162))
% 0.47/0.66  (step t164 (cl (=> (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0))) false) false) :rule resolution :premises (t147 t163))
% 0.47/0.66  (step t165 (cl (=> (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0))) false) (not false)) :rule implies_neg2)
% 0.47/0.66  (step t166 (cl (=> (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0))) false) (=> (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0))) false)) :rule resolution :premises (t164 t165))
% 0.47/0.66  (step t167 (cl (=> (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0))) false)) :rule contraction :premises (t166))
% 0.47/0.66  (step t168 (cl (= (=> (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0))) false) (not (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0)))))) :rule implies_simplify)
% 0.47/0.66  (step t169 (cl (not (=> (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0))) false)) (not (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0))))) :rule equiv1 :premises (t168))
% 0.47/0.66  (step t170 (cl (not (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0))))) :rule resolution :premises (t167 t169))
% 0.47/0.66  (step t171 (cl (= (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0))) false)) :rule resolution :premises (t146 t170))
% 0.47/0.66  (step t172 (cl (= (=> (and (not (>= tptp.a 10)) (>= tptp.a 0) (not (= tptp.a 9)) (not (= tptp.a 8)) (not (= tptp.a 7)) (not (= tptp.a 6)) (not (= tptp.a 5)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (not (= tptp.a 0))) (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0)))) (=> (and (not (>= tptp.a 10)) (>= tptp.a 0) (not (= tptp.a 9)) (not (= tptp.a 8)) (not (= tptp.a 7)) (not (= tptp.a 6)) (not (= tptp.a 5)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (not (= tptp.a 0))) false))) :rule cong :premises (t142 t171))
% 0.47/0.66  (step t173 (cl (= (=> (and (not (>= tptp.a 10)) (>= tptp.a 0) (not (= tptp.a 9)) (not (= tptp.a 8)) (not (= tptp.a 7)) (not (= tptp.a 6)) (not (= tptp.a 5)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (not (= tptp.a 0))) false) (not (and (not (>= tptp.a 10)) (>= tptp.a 0) (not (= tptp.a 9)) (not (= tptp.a 8)) (not (= tptp.a 7)) (not (= tptp.a 6)) (not (= tptp.a 5)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (not (= tptp.a 0)))))) :rule all_simplify)
% 0.47/0.66  (step t174 (cl (= (=> (and (not (>= tptp.a 10)) (>= tptp.a 0) (not (= tptp.a 9)) (not (= tptp.a 8)) (not (= tptp.a 7)) (not (= tptp.a 6)) (not (= tptp.a 5)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (not (= tptp.a 0))) (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0)))) (not (and (not (>= tptp.a 10)) (>= tptp.a 0) (not (= tptp.a 9)) (not (= tptp.a 8)) (not (= tptp.a 7)) (not (= tptp.a 6)) (not (= tptp.a 5)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (not (= tptp.a 0)))))) :rule trans :premises (t172 t173))
% 0.47/0.66  (step t175 (cl (=> (and (not (>= tptp.a 10)) (>= tptp.a 0) (not (= tptp.a 9)) (not (= tptp.a 8)) (not (= tptp.a 7)) (not (= tptp.a 6)) (not (= tptp.a 5)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (not (= tptp.a 0))) (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0)))) (and (not (>= tptp.a 10)) (>= tptp.a 0) (not (= tptp.a 9)) (not (= tptp.a 8)) (not (= tptp.a 7)) (not (= tptp.a 6)) (not (= tptp.a 5)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (not (= tptp.a 0)))) :rule implies_neg1)
% 0.47/0.66  (anchor :step t176)
% 0.47/0.66  (assume t176.a0 (not (>= tptp.a 10)))
% 0.47/0.66  (assume t176.a1 (>= tptp.a 0))
% 0.47/0.66  (assume t176.a2 (not (= tptp.a 9)))
% 0.47/0.66  (assume t176.a3 (not (= tptp.a 8)))
% 0.47/0.66  (assume t176.a4 (not (= tptp.a 7)))
% 0.47/0.66  (assume t176.a5 (not (= tptp.a 6)))
% 0.47/0.66  (assume t176.a6 (not (= tptp.a 5)))
% 0.47/0.66  (assume t176.a7 (not (= tptp.a 4)))
% 0.47/0.66  (assume t176.a8 (not (= tptp.a 3)))
% 0.47/0.66  (assume t176.a9 (not (= tptp.a 2)))
% 0.47/0.66  (assume t176.a10 (not (= tptp.a 1)))
% 0.47/0.66  (assume t176.a11 (not (= tptp.a 0)))
% 0.47/0.66  (step t176.t1 (cl (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0))) (not (not (= tptp.a 5))) (not (not (= tptp.a 6))) (not (not (= tptp.a 7))) (not (not (= tptp.a 8))) (not (not (= tptp.a 9))) (not (not (>= tptp.a 10))) (not (not (= tptp.a 4))) (not (not (= tptp.a 3))) (not (not (= tptp.a 2))) (not (not (= tptp.a 1))) (not (>= tptp.a 0)) (not (not (= tptp.a 0)))) :rule and_neg)
% 0.47/0.66  (step t176.t2 (cl (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0)))) :rule resolution :premises (t176.t1 t176.a6 t176.a5 t176.a4 t176.a3 t176.a2 t176.a0 t176.a7 t176.a8 t176.a9 t176.a10 t176.a1 t176.a11))
% 0.47/0.66  (step t176 (cl (not (not (>= tptp.a 10))) (not (>= tptp.a 0)) (not (not (= tptp.a 9))) (not (not (= tptp.a 8))) (not (not (= tptp.a 7))) (not (not (= tptp.a 6))) (not (not (= tptp.a 5))) (not (not (= tptp.a 4))) (not (not (= tptp.a 3))) (not (not (= tptp.a 2))) (not (not (= tptp.a 1))) (not (not (= tptp.a 0))) (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0)))) :rule subproof :discharge (t176.a0 t176.a1 t176.a2 t176.a3 t176.a4 t176.a5 t176.a6 t176.a7 t176.a8 t176.a9 t176.a10 t176.a11))
% 0.47/0.66  (step t177 (cl (not (and (not (>= tptp.a 10)) (>= tptp.a 0) (not (= tptp.a 9)) (not (= tptp.a 8)) (not (= tptp.a 7)) (not (= tptp.a 6)) (not (= tptp.a 5)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (not (= tptp.a 0)))) (not (>= tptp.a 10))) :rule and_pos)
% 0.47/0.66  (step t178 (cl (not (and (not (>= tptp.a 10)) (>= tptp.a 0) (not (= tptp.a 9)) (not (= tptp.a 8)) (not (= tptp.a 7)) (not (= tptp.a 6)) (not (= tptp.a 5)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (not (= tptp.a 0)))) (>= tptp.a 0)) :rule and_pos)
% 0.47/0.66  (step t179 (cl (not (and (not (>= tptp.a 10)) (>= tptp.a 0) (not (= tptp.a 9)) (not (= tptp.a 8)) (not (= tptp.a 7)) (not (= tptp.a 6)) (not (= tptp.a 5)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (not (= tptp.a 0)))) (not (= tptp.a 9))) :rule and_pos)
% 0.47/0.66  (step t180 (cl (not (and (not (>= tptp.a 10)) (>= tptp.a 0) (not (= tptp.a 9)) (not (= tptp.a 8)) (not (= tptp.a 7)) (not (= tptp.a 6)) (not (= tptp.a 5)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (not (= tptp.a 0)))) (not (= tptp.a 8))) :rule and_pos)
% 0.47/0.66  (step t181 (cl (not (and (not (>= tptp.a 10)) (>= tptp.a 0) (not (= tptp.a 9)) (not (= tptp.a 8)) (not (= tptp.a 7)) (not (= tptp.a 6)) (not (= tptp.a 5)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (not (= tptp.a 0)))) (not (= tptp.a 7))) :rule and_pos)
% 0.47/0.66  (step t182 (cl (not (and (not (>= tptp.a 10)) (>= tptp.a 0) (not (= tptp.a 9)) (not (= tptp.a 8)) (not (= tptp.a 7)) (not (= tptp.a 6)) (not (= tptp.a 5)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (not (= tptp.a 0)))) (not (= tptp.a 6))) :rule and_pos)
% 0.47/0.66  (step t183 (cl (not (and (not (>= tptp.a 10)) (>= tptp.a 0) (not (= tptp.a 9)) (not (= tptp.a 8)) (not (= tptp.a 7)) (not (= tptp.a 6)) (not (= tptp.a 5)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (not (= tptp.a 0)))) (not (= tptp.a 5))) :rule and_pos)
% 0.47/0.66  (step t184 (cl (not (and (not (>= tptp.a 10)) (>= tptp.a 0) (not (= tptp.a 9)) (not (= tptp.a 8)) (not (= tptp.a 7)) (not (= tptp.a 6)) (not (= tptp.a 5)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (not (= tptp.a 0)))) (not (= tptp.a 4))) :rule and_pos)
% 0.47/0.66  (step t185 (cl (not (and (not (>= tptp.a 10)) (>= tptp.a 0) (not (= tptp.a 9)) (not (= tptp.a 8)) (not (= tptp.a 7)) (not (= tptp.a 6)) (not (= tptp.a 5)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (not (= tptp.a 0)))) (not (= tptp.a 3))) :rule and_pos)
% 0.47/0.66  (step t186 (cl (not (and (not (>= tptp.a 10)) (>= tptp.a 0) (not (= tptp.a 9)) (not (= tptp.a 8)) (not (= tptp.a 7)) (not (= tptp.a 6)) (not (= tptp.a 5)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (not (= tptp.a 0)))) (not (= tptp.a 2))) :rule and_pos)
% 0.47/0.66  (step t187 (cl (not (and (not (>= tptp.a 10)) (>= tptp.a 0) (not (= tptp.a 9)) (not (= tptp.a 8)) (not (= tptp.a 7)) (not (= tptp.a 6)) (not (= tptp.a 5)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (not (= tptp.a 0)))) (not (= tptp.a 1))) :rule and_pos)
% 0.47/0.66  (step t188 (cl (not (and (not (>= tptp.a 10)) (>= tptp.a 0) (not (= tptp.a 9)) (not (= tptp.a 8)) (not (= tptp.a 7)) (not (= tptp.a 6)) (not (= tptp.a 5)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (not (= tptp.a 0)))) (not (= tptp.a 0))) :rule and_pos)
% 0.47/0.66  (step t189 (cl (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0))) (not (and (not (>= tptp.a 10)) (>= tptp.a 0) (not (= tptp.a 9)) (not (= tptp.a 8)) (not (= tptp.a 7)) (not (= tptp.a 6)) (not (= tptp.a 5)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (not (= tptp.a 0)))) (not (and (not (>= tptp.a 10)) (>= tptp.a 0) (not (= tptp.a 9)) (not (= tptp.a 8)) (not (= tptp.a 7)) (not (= tptp.a 6)) (not (= tptp.a 5)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (not (= tptp.a 0)))) (not (and (not (>= tptp.a 10)) (>= tptp.a 0) (not (= tptp.a 9)) (not (= tptp.a 8)) (not (= tptp.a 7)) (not (= tptp.a 6)) (not (= tptp.a 5)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (not (= tptp.a 0)))) (not (and (not (>= tptp.a 10)) (>= tptp.a 0) (not (= tptp.a 9)) (not (= tptp.a 8)) (not (= tptp.a 7)) (not (= tptp.a 6)) (not (= tptp.a 5)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (not (= tptp.a 0)))) (not (and (not (>= tptp.a 10)) (>= tptp.a 0) (not (= tptp.a 9)) (not (= tptp.a 8)) (not (= tptp.a 7)) (not (= tptp.a 6)) (not (= tptp.a 5)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (not (= tptp.a 0)))) (not (and (not (>= tptp.a 10)) (>= tptp.a 0) (not (= tptp.a 9)) (not (= tptp.a 8)) (not (= tptp.a 7)) (not (= tptp.a 6)) (not (= tptp.a 5)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (not (= tptp.a 0)))) (not (and (not (>= tptp.a 10)) (>= tptp.a 0) (not (= tptp.a 9)) (not (= tptp.a 8)) (not (= tptp.a 7)) (not (= tptp.a 6)) (not (= tptp.a 5)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (not (= tptp.a 0)))) (not (and (not (>= tptp.a 10)) (>= tptp.a 0) (not (= tptp.a 9)) (not (= tptp.a 8)) (not (= tptp.a 7)) (not (= tptp.a 6)) (not (= tptp.a 5)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (not (= tptp.a 0)))) (not (and (not (>= tptp.a 10)) (>= tptp.a 0) (not (= tptp.a 9)) (not (= tptp.a 8)) (not (= tptp.a 7)) (not (= tptp.a 6)) (not (= tptp.a 5)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (not (= tptp.a 0)))) (not (and (not (>= tptp.a 10)) (>= tptp.a 0) (not (= tptp.a 9)) (not (= tptp.a 8)) (not (= tptp.a 7)) (not (= tptp.a 6)) (not (= tptp.a 5)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (not (= tptp.a 0)))) (not (and (not (>= tptp.a 10)) (>= tptp.a 0) (not (= tptp.a 9)) (not (= tptp.a 8)) (not (= tptp.a 7)) (not (= tptp.a 6)) (not (= tptp.a 5)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (not (= tptp.a 0)))) (not (and (not (>= tptp.a 10)) (>= tptp.a 0) (not (= tptp.a 9)) (not (= tptp.a 8)) (not (= tptp.a 7)) (not (= tptp.a 6)) (not (= tptp.a 5)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (not (= tptp.a 0))))) :rule resolution :premises (t176 t177 t178 t179 t180 t181 t182 t183 t184 t185 t186 t187 t188))
% 0.47/0.66  (step t190 (cl (not (and (not (>= tptp.a 10)) (>= tptp.a 0) (not (= tptp.a 9)) (not (= tptp.a 8)) (not (= tptp.a 7)) (not (= tptp.a 6)) (not (= tptp.a 5)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (not (= tptp.a 0)))) (not (and (not (>= tptp.a 10)) (>= tptp.a 0) (not (= tptp.a 9)) (not (= tptp.a 8)) (not (= tptp.a 7)) (not (= tptp.a 6)) (not (= tptp.a 5)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (not (= tptp.a 0)))) (not (and (not (>= tptp.a 10)) (>= tptp.a 0) (not (= tptp.a 9)) (not (= tptp.a 8)) (not (= tptp.a 7)) (not (= tptp.a 6)) (not (= tptp.a 5)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (not (= tptp.a 0)))) (not (and (not (>= tptp.a 10)) (>= tptp.a 0) (not (= tptp.a 9)) (not (= tptp.a 8)) (not (= tptp.a 7)) (not (= tptp.a 6)) (not (= tptp.a 5)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (not (= tptp.a 0)))) (not (and (not (>= tptp.a 10)) (>= tptp.a 0) (not (= tptp.a 9)) (not (= tptp.a 8)) (not (= tptp.a 7)) (not (= tptp.a 6)) (not (= tptp.a 5)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (not (= tptp.a 0)))) (not (and (not (>= tptp.a 10)) (>= tptp.a 0) (not (= tptp.a 9)) (not (= tptp.a 8)) (not (= tptp.a 7)) (not (= tptp.a 6)) (not (= tptp.a 5)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (not (= tptp.a 0)))) (not (and (not (>= tptp.a 10)) (>= tptp.a 0) (not (= tptp.a 9)) (not (= tptp.a 8)) (not (= tptp.a 7)) (not (= tptp.a 6)) (not (= tptp.a 5)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (not (= tptp.a 0)))) (not (and (not (>= tptp.a 10)) (>= tptp.a 0) (not (= tptp.a 9)) (not (= tptp.a 8)) (not (= tptp.a 7)) (not (= tptp.a 6)) (not (= tptp.a 5)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (not (= tptp.a 0)))) (not (and (not (>= tptp.a 10)) (>= tptp.a 0) (not (= tptp.a 9)) (not (= tptp.a 8)) (not (= tptp.a 7)) (not (= tptp.a 6)) (not (= tptp.a 5)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (not (= tptp.a 0)))) (not (and (not (>= tptp.a 10)) (>= tptp.a 0) (not (= tptp.a 9)) (not (= tptp.a 8)) (not (= tptp.a 7)) (not (= tptp.a 6)) (not (= tptp.a 5)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (not (= tptp.a 0)))) (not (and (not (>= tptp.a 10)) (>= tptp.a 0) (not (= tptp.a 9)) (not (= tptp.a 8)) (not (= tptp.a 7)) (not (= tptp.a 6)) (not (= tptp.a 5)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (not (= tptp.a 0)))) (not (and (not (>= tptp.a 10)) (>= tptp.a 0) (not (= tptp.a 9)) (not (= tptp.a 8)) (not (= tptp.a 7)) (not (= tptp.a 6)) (not (= tptp.a 5)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (not (= tptp.a 0)))) (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0)))) :rule reordering :premises (t189))
% 0.47/0.66  (step t191 (cl (not (and (not (>= tptp.a 10)) (>= tptp.a 0) (not (= tptp.a 9)) (not (= tptp.a 8)) (not (= tptp.a 7)) (not (= tptp.a 6)) (not (= tptp.a 5)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (not (= tptp.a 0)))) (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0)))) :rule contraction :premises (t190))
% 0.47/0.66  (step t192 (cl (=> (and (not (>= tptp.a 10)) (>= tptp.a 0) (not (= tptp.a 9)) (not (= tptp.a 8)) (not (= tptp.a 7)) (not (= tptp.a 6)) (not (= tptp.a 5)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (not (= tptp.a 0))) (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0)))) (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0)))) :rule resolution :premises (t175 t191))
% 0.47/0.66  (step t193 (cl (=> (and (not (>= tptp.a 10)) (>= tptp.a 0) (not (= tptp.a 9)) (not (= tptp.a 8)) (not (= tptp.a 7)) (not (= tptp.a 6)) (not (= tptp.a 5)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (not (= tptp.a 0))) (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0)))) (not (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0))))) :rule implies_neg2)
% 0.47/0.66  (step t194 (cl (=> (and (not (>= tptp.a 10)) (>= tptp.a 0) (not (= tptp.a 9)) (not (= tptp.a 8)) (not (= tptp.a 7)) (not (= tptp.a 6)) (not (= tptp.a 5)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (not (= tptp.a 0))) (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0)))) (=> (and (not (>= tptp.a 10)) (>= tptp.a 0) (not (= tptp.a 9)) (not (= tptp.a 8)) (not (= tptp.a 7)) (not (= tptp.a 6)) (not (= tptp.a 5)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (not (= tptp.a 0))) (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0))))) :rule resolution :premises (t192 t193))
% 0.47/0.66  (step t195 (cl (=> (and (not (>= tptp.a 10)) (>= tptp.a 0) (not (= tptp.a 9)) (not (= tptp.a 8)) (not (= tptp.a 7)) (not (= tptp.a 6)) (not (= tptp.a 5)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (not (= tptp.a 0))) (and (not (= tptp.a 5)) (not (= tptp.a 6)) (not (= tptp.a 7)) (not (= tptp.a 8)) (not (= tptp.a 9)) (not (>= tptp.a 10)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (>= tptp.a 0) (not (= tptp.a 0))))) :rule contraction :premises (t194))
% 0.47/0.66  (step t196 (cl (not (and (not (>= tptp.a 10)) (>= tptp.a 0) (not (= tptp.a 9)) (not (= tptp.a 8)) (not (= tptp.a 7)) (not (= tptp.a 6)) (not (= tptp.a 5)) (not (= tptp.a 4)) (not (= tptp.a 3)) (not (= tptp.a 2)) (not (= tptp.a 1)) (not (= tptp.a 0))))) :rule resolution :premises (t141 t174 t195))
% 0.47/0.66  (step t197 (cl (not (not (>= tptp.a 10))) (not (>= tptp.a 0)) (not (not (= tptp.a 9))) (not (not (= tptp.a 8))) (not (not (= tptp.a 7))) (not (not (= tptp.a 6))) (not (not (= tptp.a 5))) (not (not (= tptp.a 4))) (not (not (= tptp.a 3))) (not (not (= tptp.a 2))) (not (not (= tptp.a 1))) (not (not (= tptp.a 0)))) :rule not_and :premises (t196))
% 0.47/0.66  (step t198 (cl (or (not (not (>= tptp.a 10))) (not (>= tptp.a 0)) (not (not (= tptp.a 9))) (not (not (= tptp.a 8))) (not (not (= tptp.a 7))) (not (not (= tptp.a 6))) (not (not (= tptp.a 5))) (not (not (= tptp.a 4))) (not (not (= tptp.a 3))) (not (not (= tptp.a 2))) (not (not (= tptp.a 1))) (not (not (= tptp.a 0)))) (not (not (not (>= tptp.a 10))))) :rule or_neg)
% 0.47/0.66  (step t199 (cl (or (not (not (>= tptp.a 10))) (not (>= tptp.a 0)) (not (not (= tptp.a 9))) (not (not (= tptp.a 8))) (not (not (= tptp.a 7))) (not (not (= tptp.a 6))) (not (not (= tptp.a 5))) (not (not (= tptp.a 4))) (not (not (= tptp.a 3))) (not (not (= tptp.a 2))) (not (not (= tptp.a 1))) (not (not (= tptp.a 0)))) (not (not (>= tptp.a 0)))) :rule or_neg)
% 0.47/0.66  (step t200 (cl (or (not (not (>= tptp.a 10))) (not (>= tptp.a 0)) (not (not (= tptp.a 9))) (not (not (= tptp.a 8))) (not (not (= tptp.a 7))) (not (not (= tptp.a 6))) (not (not (= tptp.a 5))) (not (not (= tptp.a 4))) (not (not (= tptp.a 3))) (not (not (= tptp.a 2))) (not (not (= tptp.a 1))) (not (not (= tptp.a 0)))) (not (not (not (= tptp.a 9))))) :rule or_neg)
% 0.47/0.66  (step t201 (cl (or (not (not (>= tptp.a 10))) (not (>= tptp.a 0)) (not (not (= tptp.a 9))) (not (not (= tptp.a 8))) (not (not (= tptp.a 7))) (not (not (= tptp.a 6))) (not (not (= tptp.a 5))) (not (not (= tptp.a 4))) (not (not (= tptp.a 3))) (not (not (= tptp.a 2))) (not (not (= tptp.a 1))) (not (not (= tptp.a 0)))) (not (not (not (= tptp.a 8))))) :rule or_neg)
% 0.47/0.66  (step t202 (cl (or (not (not (>= tptp.a 10))) (not (>= tptp.a 0)) (not (not (= tptp.a 9))) (not (not (= tptp.a 8))) (not (not (= tptp.a 7))) (not (not (= tptp.a 6))) (not (not (= tptp.a 5))) (not (not (= tptp.a 4))) (not (not (= tptp.a 3))) (not (not (= tptp.a 2))) (not (not (= tptp.a 1))) (not (not (= tptp.a 0)))) (not (not (not (= tptp.a 7))))) :rule or_neg)
% 0.47/0.66  (step t203 (cl (or (not (not (>= tptp.a 10))) (not (>= tptp.a 0)) (not (not (= tptp.a 9))) (not (not (= tptp.a 8))) (not (not (= tptp.a 7))) (not (not (= tptp.a 6))) (not (not (= tptp.a 5))) (not (not (= tptp.a 4))) (not (not (= tptp.a 3))) (not (not (= tptp.a 2))) (not (not (= tptp.a 1))) (not (not (= tptp.a 0)))) (not (not (not (= tptp.a 6))))) :rule or_neg)
% 0.47/0.66  (step t204 (cl (or (not (not (>= tptp.a 10))) (not (>= tptp.a 0)) (not (not (= tptp.a 9))) (not (not (= tptp.a 8))) (not (not (= tptp.a 7))) (not (not (= tptp.a 6))) (not (not (= tptp.a 5))) (not (not (= tptp.a 4))) (not (not (= tptp.a 3))) (not (not (= tptp.a 2))) (not (not (= tptp.a 1))) (not (not (= tptp.a 0)))) (not (not (not (= tptp.a 5))))) :rule or_neg)
% 0.47/0.66  (step t205 (cl (or (not (not (>= tptp.a 10))) (not (>= tptp.a 0)) (not (not (= tptp.a 9))) (not (not (= tptp.a 8))) (not (not (= tptp.a 7))) (not (not (= tptp.a 6))) (not (not (= tptp.a 5))) (not (not (= tptp.a 4))) (not (not (= tptp.a 3))) (not (not (= tptp.a 2))) (not (not (= tptp.a 1))) (not (not (= tptp.a 0)))) (not (not (not (= tptp.a 4))))) :rule or_neg)
% 0.47/0.66  (step t206 (cl (or (not (not (>= tptp.a 10))) (not (>= tptp.a 0)) (not (not (= tptp.a 9))) (not (not (= tptp.a 8))) (not (not (= tptp.a 7))) (not (not (= tptp.a 6))) (not (not (= tptp.a 5))) (not (not (= tptp.a 4))) (not (not (= tptp.a 3))) (not (not (= tptp.a 2))) (not (not (= tptp.a 1))) (not (not (= tptp.a 0)))) (not (not (not (= tptp.a 3))))) :rule or_neg)
% 0.47/0.66  (step t207 (cl (or (not (not (>= tptp.a 10))) (not (>= tptp.a 0)) (not (not (= tptp.a 9))) (not (not (= tptp.a 8))) (not (not (= tptp.a 7))) (not (not (= tptp.a 6))) (not (not (= tptp.a 5))) (not (not (= tptp.a 4))) (not (not (= tptp.a 3))) (not (not (= tptp.a 2))) (not (not (= tptp.a 1))) (not (not (= tptp.a 0)))) (not (not (not (= tptp.a 2))))) :rule or_neg)
% 0.47/0.66  (step t208 (cl (or (not (not (>= tptp.a 10))) (not (>= tptp.a 0)) (not (not (= tptp.a 9))) (not (not (= tptp.a 8))) (not (not (= tptp.a 7))) (not (not (= tptp.a 6))) (not (not (= tptp.a 5))) (not (not (= tptp.a 4))) (not (not (= tptp.a 3))) (not (not (= tptp.a 2))) (not (not (= tptp.a 1))) (not (not (= tptp.a 0)))) (not (not (not (= tptp.a 1))))) :rule or_neg)
% 0.47/0.66  (step t209 (cl (or (not (not (>= tptp.a 10))) (not (>= tptp.a 0)) (not (not (= tptp.a 9))) (not (not (= tptp.a 8))) (not (not (= tptp.a 7))) (not (not (= tptp.a 6))) (not (not (= tptp.a 5))) (not (not (= tptp.a 4))) (not (not (= tptp.a 3))) (not (not (= tptp.a 2))) (not (not (= tptp.a 1))) (not (not (= tptp.a 0)))) (not (not (not (= tptp.a 0))))) :rule or_neg)
% 0.47/0.66  (step t210 (cl (or (not (not (>= tptp.a 10))) (not (>= tptp.a 0)) (not (not (= tptp.a 9))) (not (not (= tptp.a 8))) (not (not (= tptp.a 7))) (not (not (= tptp.a 6))) (not (not (= tptp.a 5))) (not (not (= tptp.a 4))) (not (not (= tptp.a 3))) (not (not (= tptp.a 2))) (not (not (= tptp.a 1))) (not (not (= tptp.a 0)))) (or (not (not (>= tptp.a 10))) (not (>= tptp.a 0)) (not (not (= tptp.a 9))) (not (not (= tptp.a 8))) (not (not (= tptp.a 7))) (not (not (= tptp.a 6))) (not (not (= tptp.a 5))) (not (not (= tptp.a 4))) (not (not (= tptp.a 3))) (not (not (= tptp.a 2))) (not (not (= tptp.a 1))) (not (not (= tptp.a 0)))) (or (not (not (>= tptp.a 10))) (not (>= tptp.a 0)) (not (not (= tptp.a 9))) (not (not (= tptp.a 8))) (not (not (= tptp.a 7))) (not (not (= tptp.a 6))) (not (not (= tptp.a 5))) (not (not (= tptp.a 4))) (not (not (= tptp.a 3))) (not (not (= tptp.a 2))) (not (not (= tptp.a 1))) (not (not (= tptp.a 0)))) (or (not (not (>= tptp.a 10))) (not (>= tptp.a 0)) (not (not (= tptp.a 9))) (not (not (= tptp.a 8))) (not (not (= tptp.a 7))) (not (not (= tptp.a 6))) (not (not (= tptp.a 5))) (not (not (= tptp.a 4))) (not (not (= tptp.a 3))) (not (not (= tptp.a 2))) (not (not (= tptp.a 1))) (not (not (= tptp.a 0)))) (or (not (not (>= tptp.a 10))) (not (>= tptp.a 0)) (not (not (= tptp.a 9))) (not (not (= tptp.a 8))) (not (not (= tptp.a 7))) (not (not (= tptp.a 6))) (not (not (= tptp.a 5))) (not (not (= tptp.a 4))) (not (not (= tptp.a 3))) (not (not (= tptp.a 2))) (not (not (= tptp.a 1))) (not (not (= tptp.a 0)))) (or (not (not (>= tptp.a 10))) (not (>= tptp.a 0)) (not (not (= tptp.a 9))) (not (not (= tptp.a 8))) (not (not (= tptp.a 7))) (not (not (= tptp.a 6))) (not (not (= tptp.a 5))) (not (not (= tptp.a 4))) (not (not (= tptp.a 3))) (not (not (= tptp.a 2))) (not (not (= tptp.a 1))) (not (not (= tptp.a 0)))) (or (not (not (>= tptp.a 10))) (not (>= tptp.a 0)) (not (not (= tptp.a 9))) (not (not (= tptp.a 8))) (not (not (= tptp.a 7))) (not (not (= tptp.a 6))) (not (not (= tptp.a 5))) (not (not (= tptp.a 4))) (not (not (= tptp.a 3))) (not (not (= tptp.a 2))) (not (not (= tptp.a 1))) (not (not (= tptp.a 0)))) (or (not (not (>= tptp.a 10))) (not (>= tptp.a 0)) (not (not (= tptp.a 9))) (not (not (= tptp.a 8))) (not (not (= tptp.a 7))) (not (not (= tptp.a 6))) (not (not (= tptp.a 5))) (not (not (= tptp.a 4))) (not (not (= tptp.a 3))) (not (not (= tptp.a 2))) (not (not (= tptp.a 1))) (not (not (= tptp.a 0)))) (or (not (not (>= tptp.a 10))) (not (>= tptp.a 0)) (not (not (= tptp.a 9))) (not (not (= tptp.a 8))) (not (not (= tptp.a 7))) (not (not (= tptp.a 6))) (not (not (= tptp.a 5))) (not (not (= tptp.a 4))) (not (not (= tptp.a 3))) (not (not (= tptp.a 2))) (not (not (= tptp.a 1))) (not (not (= tptp.a 0)))) (or (not (not (>= tptp.a 10))) (not (>= tptp.a 0)) (not (not (= tptp.a 9))) (not (not (= tptp.a 8))) (not (not (= tptp.a 7))) (not (not (= tptp.a 6))) (not (not (= tptp.a 5))) (not (not (= tptp.a 4))) (not (not (= tptp.a 3))) (not (not (= tptp.a 2))) (not (not (= tptp.a 1))) (not (not (= tptp.a 0)))) (or (not (not (>= tptp.a 10))) (not (>= tptp.a 0)) (not (not (= tptp.a 9))) (not (not (= tptp.a 8))) (not (not (= tptp.a 7))) (not (not (= tptp.a 6))) (not (not (= tptp.a 5))) (not (not (= tptp.a 4))) (not (not (= tptp.a 3))) (not (not (= tptp.a 2))) (not (not (= tptp.a 1))) (not (not (= tptp.a 0)))) (or (not (not (>= tptp.a 10))) (not (>= tptp.a 0)) (not (not (= tptp.a 9))) (not (not (= tptp.a 8))) (not (not (= tptp.a 7))) (not (not (= tptp.a 6))) (not (not (= tptp.a 5))) (not (not (= tptp.a 4))) (not (not (= tptp.a 3))) (not (not (= tptp.a 2))) (not (not (= tptp.a 1))) (not (not (= tptp.a 0))))) :rule resolution :premises (t197 t198 t199 t200 t201 t202 t203 t204 t205 t206 t207 t208 t209))
% 0.47/0.66  (step t211 (cl (or (not (not (>= tptp.a 10))) (not (>= tptp.a 0)) (not (not (= tptp.a 9))) (not (not (= tptp.a 8))) (not (not (= tptp.a 7))) (not (not (= tptp.a 6))) (not (not (= tptp.a 5))) (not (not (= tptp.a 4))) (not (not (= tptp.a 3))) (not (not (= tptp.a 2))) (not (not (= tptp.a 1))) (not (not (= tptp.a 0))))) :rule contraction :premises (t210))
% 0.47/0.66  (step t212 (cl (or (>= tptp.a 10) (not (>= tptp.a 0)) (= tptp.a 9) (= tptp.a 8) (= tptp.a 7) (= tptp.a 6) (= tptp.a 5) (= tptp.a 4) (= tptp.a 3) (= tptp.a 2) (= tptp.a 1) (= tptp.a 0))) :rule resolution :premises (t39 t140 t211))
% 0.47/0.66  (step t213 (cl (>= tptp.a 10) (not (>= tptp.a 0)) (= tptp.a 9) (= tptp.a 8) (= tptp.a 7) (= tptp.a 6) (= tptp.a 5) (= tptp.a 4) (= tptp.a 3) (= tptp.a 2) (= tptp.a 1) (= tptp.a 0)) :rule or :premises (t212))
% 0.47/0.66  (step t214 (cl (= tptp.a 9) (= tptp.a 8) (= tptp.a 7) (= tptp.a 6) (= tptp.a 5) (= tptp.a 4) (= tptp.a 3) (= tptp.a 2) (= tptp.a 1) (= tptp.a 0) (>= tptp.a 10) (not (>= tptp.a 0))) :rule reordering :premises (t213))
% 0.47/0.66  (step t215 (cl (or (= tptp.a 9) (= tptp.a 8) (= tptp.a 7) (= tptp.a 6) (= tptp.a 5) (= tptp.a 4) (= tptp.a 3) (= tptp.a 2) (= tptp.a 1) (= tptp.a 0)) (not (= tptp.a 0))) :rule or_neg)
% 0.47/0.66  (step t216 (cl (or (= tptp.a 9) (= tptp.a 8) (= tptp.a 7) (= tptp.a 6) (= tptp.a 5) (= tptp.a 4) (= tptp.a 3) (= tptp.a 2) (= tptp.a 1) (= tptp.a 0)) (not (= tptp.a 1))) :rule or_neg)
% 0.47/0.66  (step t217 (cl (or (= tptp.a 9) (= tptp.a 8) (= tptp.a 7) (= tptp.a 6) (= tptp.a 5) (= tptp.a 4) (= tptp.a 3) (= tptp.a 2) (= tptp.a 1) (= tptp.a 0)) (not (= tptp.a 2))) :rule or_neg)
% 0.47/0.66  (step t218 (cl (or (= tptp.a 9) (= tptp.a 8) (= tptp.a 7) (= tptp.a 6) (= tptp.a 5) (= tptp.a 4) (= tptp.a 3) (= tptp.a 2) (= tptp.a 1) (= tptp.a 0)) (not (= tptp.a 3))) :rule or_neg)
% 0.47/0.66  (step t219 (cl (or (= tptp.a 9) (= tptp.a 8) (= tptp.a 7) (= tptp.a 6) (= tptp.a 5) (= tptp.a 4) (= tptp.a 3) (= tptp.a 2) (= tptp.a 1) (= tptp.a 0)) (not (= tptp.a 4))) :rule or_neg)
% 0.47/0.66  (step t220 (cl (or (= tptp.a 9) (= tptp.a 8) (= tptp.a 7) (= tptp.a 6) (= tptp.a 5) (= tptp.a 4) (= tptp.a 3) (= tptp.a 2) (= tptp.a 1) (= tptp.a 0)) (not (= tptp.a 5))) :rule or_neg)
% 0.47/0.66  (step t221 (cl (or (= tptp.a 9) (= tptp.a 8) (= tptp.a 7) (= tptp.a 6) (= tptp.a 5) (= tptp.a 4) (= tptp.a 3) (= tptp.a 2) (= tptp.a 1) (= tptp.a 0)) (not (= tptp.a 6))) :rule or_neg)
% 0.47/0.66  (step t222 (cl (or (= tptp.a 9) (= tptp.a 8) (= tptp.a 7) (= tptp.a 6) (= tptp.a 5) (= tptp.a 4) (= tptp.a 3) (= tptp.a 2) (= tptp.a 1) (= tptp.a 0)) (not (= tptp.a 7))) :rule or_neg)
% 0.47/0.66  (step t223 (cl (or (= tptp.a 9) (= tptp.a 8) (= tptp.a 7) (= tptp.a 6) (= tptp.a 5) (= tptp.a 4) (= tptp.a 3) (= tptp.a 2) (= tptp.a 1) (= tptp.a 0)) (not (= tptp.a 8))) :rule or_neg)
% 0.47/0.66  (step t224 (cl (not (and (not (>= tptp.a 10)) (>= tptp.a 0))) (>= tptp.a 0)) :rule and_pos)
% 0.47/0.66  (step t225 (cl (>= tptp.a 0) (not (and (not (>= tptp.a 10)) (>= tptp.a 0)))) :rule reordering :premises (t224))
% 0.47/0.66  (step t226 (cl (= tptp.a 9) (>= tptp.a 10) (or (= tptp.a 9) (= tptp.a 8) (= tptp.a 7) (= tptp.a 6) (= tptp.a 5) (= tptp.a 4) (= tptp.a 3) (= tptp.a 2) (= tptp.a 1) (= tptp.a 0)) (or (= tptp.a 9) (= tptp.a 8) (= tptp.a 7) (= tptp.a 6) (= tptp.a 5) (= tptp.a 4) (= tptp.a 3) (= tptp.a 2) (= tptp.a 1) (= tptp.a 0)) (or (= tptp.a 9) (= tptp.a 8) (= tptp.a 7) (= tptp.a 6) (= tptp.a 5) (= tptp.a 4) (= tptp.a 3) (= tptp.a 2) (= tptp.a 1) (= tptp.a 0)) (or (= tptp.a 9) (= tptp.a 8) (= tptp.a 7) (= tptp.a 6) (= tptp.a 5) (= tptp.a 4) (= tptp.a 3) (= tptp.a 2) (= tptp.a 1) (= tptp.a 0)) (or (= tptp.a 9) (= tptp.a 8) (= tptp.a 7) (= tptp.a 6) (= tptp.a 5) (= tptp.a 4) (= tptp.a 3) (= tptp.a 2) (= tptp.a 1) (= tptp.a 0)) (or (= tptp.a 9) (= tptp.a 8) (= tptp.a 7) (= tptp.a 6) (= tptp.a 5) (= tptp.a 4) (= tptp.a 3) (= tptp.a 2) (= tptp.a 1) (= tptp.a 0)) (or (= tptp.a 9) (= tptp.a 8) (= tptp.a 7) (= tptp.a 6) (= tptp.a 5) (= tptp.a 4) (= tptp.a 3) (= tptp.a 2) (= tptp.a 1) (= tptp.a 0)) (or (= tptp.a 9) (= tptp.a 8) (= tptp.a 7) (= tptp.a 6) (= tptp.a 5) (= tptp.a 4) (= tptp.a 3) (= tptp.a 2) (= tptp.a 1) (= tptp.a 0)) (or (= tptp.a 9) (= tptp.a 8) (= tptp.a 7) (= tptp.a 6) (= tptp.a 5) (= tptp.a 4) (= tptp.a 3) (= tptp.a 2) (= tptp.a 1) (= tptp.a 0)) (not (and (not (>= tptp.a 10)) (>= tptp.a 0)))) :rule resolution :premises (t214 t215 t216 t217 t218 t219 t220 t221 t222 t223 t225))
% 0.47/0.66  (step t227 (cl (= tptp.a 9) (>= tptp.a 10) (or (= tptp.a 9) (= tptp.a 8) (= tptp.a 7) (= tptp.a 6) (= tptp.a 5) (= tptp.a 4) (= tptp.a 3) (= tptp.a 2) (= tptp.a 1) (= tptp.a 0)) (not (and (not (>= tptp.a 10)) (>= tptp.a 0)))) :rule contraction :premises (t226))
% 0.47/0.66  (step t228 (cl (not (and (not (>= tptp.a 10)) (>= tptp.a 0))) (not (>= tptp.a 10))) :rule and_pos)
% 0.47/0.66  (step t229 (cl (not (>= tptp.a 10)) (not (and (not (>= tptp.a 10)) (>= tptp.a 0)))) :rule reordering :premises (t228))
% 0.47/0.66  (step t230 (cl (= tptp.a 9) (not (and (not (>= tptp.a 10)) (>= tptp.a 0))) (not (and (not (>= tptp.a 10)) (>= tptp.a 0))) (not (and (not (>= tptp.a 10)) (>= tptp.a 0)))) :rule resolution :premises (t227 t37 t229))
% 0.47/0.66  (step t231 (cl (= tptp.a 9) (not (and (not (>= tptp.a 10)) (>= tptp.a 0)))) :rule contraction :premises (t230))
% 0.47/0.66  (step t232 (cl (not (or (= tptp.a 9) (= tptp.a 8) (= tptp.a 7) (= tptp.a 6) (= tptp.a 5) (= tptp.a 4) (= tptp.a 3) (= tptp.a 2) (= tptp.a 1) (= tptp.a 0))) (= tptp.a 9) (= tptp.a 8) (= tptp.a 7) (= tptp.a 6) (= tptp.a 5) (= tptp.a 4) (= tptp.a 3) (= tptp.a 2) (= tptp.a 1) (= tptp.a 0)) :rule or_pos)
% 0.47/0.66  (step t233 (cl (= tptp.a 9) (= tptp.a 8) (= tptp.a 7) (= tptp.a 6) (= tptp.a 5) (= tptp.a 4) (= tptp.a 3) (= tptp.a 2) (= tptp.a 1) (= tptp.a 0) (not (or (= tptp.a 9) (= tptp.a 8) (= tptp.a 7) (= tptp.a 6) (= tptp.a 5) (= tptp.a 4) (= tptp.a 3) (= tptp.a 2) (= tptp.a 1) (= tptp.a 0)))) :rule reordering :premises (t232))
% 0.47/0.66  (step t234 (cl (=> (and (>= tptp.a 10) (= tptp.a 8)) false) (and (>= tptp.a 10) (= tptp.a 8))) :rule implies_neg1)
% 0.47/0.66  (anchor :step t235)
% 0.47/0.66  (assume t235.a0 (>= tptp.a 10))
% 0.47/0.66  (assume t235.a1 (= tptp.a 8))
% 0.47/0.66  (step t235.t1 (cl (not (= (<= (+ (* 1 tptp.a) (* (- 1) tptp.a)) (+ (* 1 8) (* (- 1) 10))) false)) (not (<= (+ (* 1 tptp.a) (* (- 1) tptp.a)) (+ (* 1 8) (* (- 1) 10)))) false) :rule equiv_pos2)
% 0.47/0.66  (step t235.t2 (cl (= (* 1 tptp.a) tptp.a)) :rule all_simplify)
% 0.47/0.66  (step t235.t3 (cl (= (* (- 1) tptp.a) (* (- 1) tptp.a))) :rule refl)
% 0.47/0.66  (step t235.t4 (cl (= (+ (* 1 tptp.a) (* (- 1) tptp.a)) (+ tptp.a (* (- 1) tptp.a)))) :rule cong :premises (t235.t2 t235.t3))
% 0.47/0.66  (step t235.t5 (cl (= (+ tptp.a (* (- 1) tptp.a)) 0)) :rule all_simplify)
% 0.47/0.66  (step t235.t6 (cl (= (+ (* 1 tptp.a) (* (- 1) tptp.a)) 0)) :rule trans :premises (t235.t4 t235.t5))
% 0.47/0.66  (step t235.t7 (cl (= (* 1 8) 8)) :rule all_simplify)
% 0.47/0.66  (step t235.t8 (cl (= (* (- 1) 10) (- 10))) :rule all_simplify)
% 0.47/0.66  (step t235.t9 (cl (= (+ (* 1 8) (* (- 1) 10)) (+ 8 (- 10)))) :rule cong :premises (t235.t7 t235.t8))
% 0.47/0.66  (step t235.t10 (cl (= (+ 8 (- 10)) (- 2))) :rule all_simplify)
% 0.47/0.66  (step t235.t11 (cl (= (+ (* 1 8) (* (- 1) 10)) (- 2))) :rule trans :premises (t235.t9 t235.t10))
% 0.47/0.66  (step t235.t12 (cl (= (<= (+ (* 1 tptp.a) (* (- 1) tptp.a)) (+ (* 1 8) (* (- 1) 10))) (<= 0 (- 2)))) :rule cong :premises (t235.t6 t235.t11))
% 0.47/0.66  (step t235.t13 (cl (= (<= 0 (- 2)) false)) :rule all_simplify)
% 0.47/0.66  (step t235.t14 (cl (= (<= (+ (* 1 tptp.a) (* (- 1) tptp.a)) (+ (* 1 8) (* (- 1) 10))) false)) :rule trans :premises (t235.t12 t235.t13))
% 0.47/0.66  (step t235.t15 (cl (not (= (* 1 tptp.a) (* 1 8))) (not (<= (* (- 1) tptp.a) (* (- 1) 10))) (<= (+ (* 1 tptp.a) (* (- 1) tptp.a)) (+ (* 1 8) (* (- 1) 10)))) :rule la_generic :args ((- 1) 1 1))
% 0.47/0.66  (step t235.t16 (cl (=> (and (> 1 0) (= tptp.a 8)) (= (* 1 tptp.a) (* 1 8)))) :rule la_mult_pos)
% 0.47/0.66  (step t235.t17 (cl (not (and (> 1 0) (= tptp.a 8))) (= (* 1 tptp.a) (* 1 8))) :rule implies :premises (t235.t16))
% 0.47/0.66  (step t235.t18 (cl (and (> 1 0) (= tptp.a 8)) (not (> 1 0)) (not (= tptp.a 8))) :rule and_neg)
% 0.47/0.66  (step t235.t19 (cl (= (= (> 1 0) true) (> 1 0))) :rule equiv_simplify)
% 0.47/0.66  (step t235.t20 (cl (not (= (> 1 0) true)) (> 1 0)) :rule equiv1 :premises (t235.t19))
% 0.47/0.66  (step t235.t21 (cl (= (> 1 0) true)) :rule hole :args ((> 1 0)))
% 0.47/0.66  (step t235.t22 (cl (> 1 0)) :rule resolution :premises (t235.t20 t235.t21))
% 0.47/0.66  (step t235.t23 (cl (and (> 1 0) (= tptp.a 8))) :rule resolution :premises (t235.t18 t235.t22 t235.a1))
% 0.47/0.66  (step t235.t24 (cl (= (* 1 tptp.a) (* 1 8))) :rule resolution :premises (t235.t17 t235.t23))
% 0.47/0.66  (step t235.t25 (cl (=> (and (< (- 1) 0) (>= tptp.a 10)) (<= (* (- 1) tptp.a) (* (- 1) 10)))) :rule la_mult_neg)
% 0.47/0.66  (step t235.t26 (cl (not (and (< (- 1) 0) (>= tptp.a 10))) (<= (* (- 1) tptp.a) (* (- 1) 10))) :rule implies :premises (t235.t25))
% 0.47/0.66  (step t235.t27 (cl (and (< (- 1) 0) (>= tptp.a 10)) (not (< (- 1) 0)) (not (>= tptp.a 10))) :rule and_neg)
% 0.47/0.66  (step t235.t28 (cl (= (= (< (- 1) 0) true) (< (- 1) 0))) :rule equiv_simplify)
% 0.47/0.66  (step t235.t29 (cl (not (= (< (- 1) 0) true)) (< (- 1) 0)) :rule equiv1 :premises (t235.t28))
% 0.47/0.66  (step t235.t30 (cl (= (< (- 1) 0) true)) :rule hole :args ((< (- 1) 0)))
% 0.47/0.66  (step t235.t31 (cl (< (- 1) 0)) :rule resolution :premises (t235.t29 t235.t30))
% 0.47/0.66  (step t235.t32 (cl (and (< (- 1) 0) (>= tptp.a 10))) :rule resolution :premises (t235.t27 t235.t31 t235.a0))
% 0.47/0.66  (step t235.t33 (cl (<= (* (- 1) tptp.a) (* (- 1) 10))) :rule resolution :premises (t235.t26 t235.t32))
% 0.47/0.66  (step t235.t34 (cl (<= (+ (* 1 tptp.a) (* (- 1) tptp.a)) (+ (* 1 8) (* (- 1) 10)))) :rule resolution :premises (t235.t15 t235.t24 t235.t33))
% 0.47/0.66  (step t235.t35 (cl false) :rule resolution :premises (t235.t1 t235.t14 t235.t34))
% 0.47/0.66  (step t235 (cl (not (>= tptp.a 10)) (not (= tptp.a 8)) false) :rule subproof :discharge (t235.a0 t235.a1))
% 0.47/0.66  (step t236 (cl (not (and (>= tptp.a 10) (= tptp.a 8))) (>= tptp.a 10)) :rule and_pos)
% 0.47/0.66  (step t237 (cl (not (and (>= tptp.a 10) (= tptp.a 8))) (= tptp.a 8)) :rule and_pos)
% 0.47/0.66  (step t238 (cl false (not (and (>= tptp.a 10) (= tptp.a 8))) (not (and (>= tptp.a 10) (= tptp.a 8)))) :rule resolution :premises (t235 t236 t237))
% 0.47/0.66  (step t239 (cl (not (and (>= tptp.a 10) (= tptp.a 8))) (not (and (>= tptp.a 10) (= tptp.a 8))) false) :rule reordering :premises (t238))
% 0.47/0.66  (step t240 (cl (not (and (>= tptp.a 10) (= tptp.a 8))) false) :rule contraction :premises (t239))
% 0.47/0.66  (step t241 (cl (=> (and (>= tptp.a 10) (= tptp.a 8)) false) false) :rule resolution :premises (t234 t240))
% 0.47/0.66  (step t242 (cl (=> (and (>= tptp.a 10) (= tptp.a 8)) false) (not false)) :rule implies_neg2)
% 0.47/0.66  (step t243 (cl (=> (and (>= tptp.a 10) (= tptp.a 8)) false) (=> (and (>= tptp.a 10) (= tptp.a 8)) false)) :rule resolution :premises (t241 t242))
% 0.47/0.66  (step t244 (cl (=> (and (>= tptp.a 10) (= tptp.a 8)) false)) :rule contraction :premises (t243))
% 0.47/0.66  (step t245 (cl (= (=> (and (>= tptp.a 10) (= tptp.a 8)) false) (not (and (>= tptp.a 10) (= tptp.a 8))))) :rule implies_simplify)
% 0.47/0.66  (step t246 (cl (not (=> (and (>= tptp.a 10) (= tptp.a 8)) false)) (not (and (>= tptp.a 10) (= tptp.a 8)))) :rule equiv1 :premises (t245))
% 0.47/0.66  (step t247 (cl (not (and (>= tptp.a 10) (= tptp.a 8)))) :rule resolution :premises (t244 t246))
% 0.47/0.66  (step t248 (cl (not (>= tptp.a 10)) (not (= tptp.a 8))) :rule not_and :premises (t247))
% 0.47/0.66  (step t249 (cl (=> (and (>= tptp.a 10) (= tptp.a 7)) false) (and (>= tptp.a 10) (= tptp.a 7))) :rule implies_neg1)
% 0.47/0.66  (anchor :step t250)
% 0.47/0.66  (assume t250.a0 (>= tptp.a 10))
% 0.47/0.66  (assume t250.a1 (= tptp.a 7))
% 0.47/0.66  (step t250.t1 (cl (not (= (<= (+ (* 1 tptp.a) (* (- 1) tptp.a)) (+ (* 1 7) (* (- 1) 10))) false)) (not (<= (+ (* 1 tptp.a) (* (- 1) tptp.a)) (+ (* 1 7) (* (- 1) 10)))) false) :rule equiv_pos2)
% 0.47/0.66  (step t250.t2 (cl (= (* 1 tptp.a) tptp.a)) :rule all_simplify)
% 0.47/0.66  (step t250.t3 (cl (= (* (- 1) tptp.a) (* (- 1) tptp.a))) :rule refl)
% 0.47/0.66  (step t250.t4 (cl (= (+ (* 1 tptp.a) (* (- 1) tptp.a)) (+ tptp.a (* (- 1) tptp.a)))) :rule cong :premises (t250.t2 t250.t3))
% 0.47/0.66  (step t250.t5 (cl (= (+ tptp.a (* (- 1) tptp.a)) 0)) :rule all_simplify)
% 0.47/0.66  (step t250.t6 (cl (= (+ (* 1 tptp.a) (* (- 1) tptp.a)) 0)) :rule trans :premises (t250.t4 t250.t5))
% 0.47/0.66  (step t250.t7 (cl (= (* 1 7) 7)) :rule all_simplify)
% 0.47/0.66  (step t250.t8 (cl (= (* (- 1) 10) (- 10))) :rule all_simplify)
% 0.47/0.66  (step t250.t9 (cl (= (+ (* 1 7) (* (- 1) 10)) (+ 7 (- 10)))) :rule cong :premises (t250.t7 t250.t8))
% 0.47/0.66  (step t250.t10 (cl (= (+ 7 (- 10)) (- 3))) :rule all_simplify)
% 0.47/0.66  (step t250.t11 (cl (= (+ (* 1 7) (* (- 1) 10)) (- 3))) :rule trans :premises (t250.t9 t250.t10))
% 0.47/0.66  (step t250.t12 (cl (= (<= (+ (* 1 tptp.a) (* (- 1) tptp.a)) (+ (* 1 7) (* (- 1) 10))) (<= 0 (- 3)))) :rule cong :premises (t250.t6 t250.t11))
% 0.47/0.66  (step t250.t13 (cl (= (<= 0 (- 3)) false)) :rule all_simplify)
% 0.47/0.66  (step t250.t14 (cl (= (<= (+ (* 1 tptp.a) (* (- 1) tptp.a)) (+ (* 1 7) (* (- 1) 10))) false)) :rule trans :premises (t250.t12 t250.t13))
% 0.47/0.66  (step t250.t15 (cl (not (= (* 1 tptp.a) (* 1 7))) (not (<= (* (- 1) tptp.a) (* (- 1) 10))) (<= (+ (* 1 tptp.a) (* (- 1) tptp.a)) (+ (* 1 7) (* (- 1) 10)))) :rule la_generic :args ((- 1) 1 1))
% 0.47/0.66  (step t250.t16 (cl (=> (and (> 1 0) (= tptp.a 7)) (= (* 1 tptp.a) (* 1 7)))) :rule la_mult_pos)
% 0.47/0.66  (step t250.t17 (cl (not (and (> 1 0) (= tptp.a 7))) (= (* 1 tptp.a) (* 1 7))) :rule implies :premises (t250.t16))
% 0.47/0.66  (step t250.t18 (cl (and (> 1 0) (= tptp.a 7)) (not (> 1 0)) (not (= tptp.a 7))) :rule and_neg)
% 0.47/0.66  (step t250.t19 (cl (= (= (> 1 0) true) (> 1 0))) :rule equiv_simplify)
% 0.47/0.66  (step t250.t20 (cl (not (= (> 1 0) true)) (> 1 0)) :rule equiv1 :premises (t250.t19))
% 0.47/0.66  (step t250.t21 (cl (= (> 1 0) true)) :rule hole :args ((> 1 0)))
% 0.47/0.66  (step t250.t22 (cl (> 1 0)) :rule resolution :premises (t250.t20 t250.t21))
% 0.47/0.66  (step t250.t23 (cl (and (> 1 0) (= tptp.a 7))) :rule resolution :premises (t250.t18 t250.t22 t250.a1))
% 0.47/0.66  (step t250.t24 (cl (= (* 1 tptp.a) (* 1 7))) :rule resolution :premises (t250.t17 t250.t23))
% 0.47/0.66  (step t250.t25 (cl (=> (and (< (- 1) 0) (>= tptp.a 10)) (<= (* (- 1) tptp.a) (* (- 1) 10)))) :rule la_mult_neg)
% 0.47/0.66  (step t250.t26 (cl (not (and (< (- 1) 0) (>= tptp.a 10))) (<= (* (- 1) tptp.a) (* (- 1) 10))) :rule implies :premises (t250.t25))
% 0.47/0.66  (step t250.t27 (cl (and (< (- 1) 0) (>= tptp.a 10)) (not (< (- 1) 0)) (not (>= tptp.a 10))) :rule and_neg)
% 0.47/0.66  (step t250.t28 (cl (= (= (< (- 1) 0) true) (< (- 1) 0))) :rule equiv_simplify)
% 0.47/0.66  (step t250.t29 (cl (not (= (< (- 1) 0) true)) (< (- 1) 0)) :rule equiv1 :premises (t250.t28))
% 0.47/0.66  (step t250.t30 (cl (= (< (- 1) 0) true)) :rule hole :args ((< (- 1) 0)))
% 0.47/0.66  (step t250.t31 (cl (< (- 1) 0)) :rule resolution :premises (t250.t29 t250.t30))
% 0.47/0.66  (step t250.t32 (cl (and (< (- 1) 0) (>= tptp.a 10))) :rule resolution :premises (t250.t27 t250.t31 t250.a0))
% 0.47/0.66  (step t250.t33 (cl (<= (* (- 1) tptp.a) (* (- 1) 10))) :rule resolution :premises (t250.t26 t250.t32))
% 0.47/0.66  (step t250.t34 (cl (<= (+ (* 1 tptp.a) (* (- 1) tptp.a)) (+ (* 1 7) (* (- 1) 10)))) :rule resolution :premises (t250.t15 t250.t24 t250.t33))
% 0.47/0.66  (step t250.t35 (cl false) :rule resolution :premises (t250.t1 t250.t14 t250.t34))
% 0.47/0.66  (step t250 (cl (not (>= tptp.a 10)) (not (= tptp.a 7)) false) :rule subproof :discharge (t250.a0 t250.a1))
% 0.47/0.66  (step t251 (cl (not (and (>= tptp.a 10) (= tptp.a 7))) (>= tptp.a 10)) :rule and_pos)
% 0.47/0.66  (step t252 (cl (not (and (>= tptp.a 10) (= tptp.a 7))) (= tptp.a 7)) :rule and_pos)
% 0.47/0.66  (step t253 (cl false (not (and (>= tptp.a 10) (= tptp.a 7))) (not (and (>= tptp.a 10) (= tptp.a 7)))) :rule resolution :premises (t250 t251 t252))
% 0.47/0.66  (step t254 (cl (not (and (>= tptp.a 10) (= tptp.a 7))) (not (and (>= tptp.a 10) (= tptp.a 7))) false) :rule reordering :premises (t253))
% 0.47/0.66  (step t255 (cl (not (and (>= tptp.a 10) (= tptp.a 7))) false) :rule contraction :premises (t254))
% 0.47/0.66  (step t256 (cl (=> (and (>= tptp.a 10) (= tptp.a 7)) false) false) :rule resolution :premises (t249 t255))
% 0.47/0.66  (step t257 (cl (=> (and (>= tptp.a 10) (= tptp.a 7)) false) (not false)) :rule implies_neg2)
% 0.47/0.66  (step t258 (cl (=> (and (>= tptp.a 10) (= tptp.a 7)) false) (=> (and (>= tptp.a 10) (= tptp.a 7)) false)) :rule resolution :premises (t256 t257))
% 0.47/0.66  (step t259 (cl (=> (and (>= tptp.a 10) (= tptp.a 7)) false)) :rule contraction :premises (t258))
% 0.47/0.66  (step t260 (cl (= (=> (and (>= tptp.a 10) (= tptp.a 7)) false) (not (and (>= tptp.a 10) (= tptp.a 7))))) :rule implies_simplify)
% 0.47/0.66  (step t261 (cl (not (=> (and (>= tptp.a 10) (= tptp.a 7)) false)) (not (and (>= tptp.a 10) (= tptp.a 7)))) :rule equiv1 :premises (t260))
% 0.47/0.66  (step t262 (cl (not (and (>= tptp.a 10) (= tptp.a 7)))) :rule resolution :premises (t259 t261))
% 0.47/0.66  (step t263 (cl (not (>= tptp.a 10)) (not (= tptp.a 7))) :rule not_and :premises (t262))
% 0.47/0.66  (step t264 (cl (=> (and (>= tptp.a 10) (= tptp.a 6)) false) (and (>= tptp.a 10) (= tptp.a 6))) :rule implies_neg1)
% 0.47/0.66  (anchor :step t265)
% 0.47/0.66  (assume t265.a0 (>= tptp.a 10))
% 0.47/0.66  (assume t265.a1 (= tptp.a 6))
% 0.47/0.66  (step t265.t1 (cl (not (= (<= (+ (* 1 tptp.a) (* (- 1) tptp.a)) (+ (* 1 6) (* (- 1) 10))) false)) (not (<= (+ (* 1 tptp.a) (* (- 1) tptp.a)) (+ (* 1 6) (* (- 1) 10)))) false) :rule equiv_pos2)
% 0.47/0.66  (step t265.t2 (cl (= (* 1 tptp.a) tptp.a)) :rule all_simplify)
% 0.47/0.66  (step t265.t3 (cl (= (* (- 1) tptp.a) (* (- 1) tptp.a))) :rule refl)
% 0.47/0.66  (step t265.t4 (cl (= (+ (* 1 tptp.a) (* (- 1) tptp.a)) (+ tptp.a (* (- 1) tptp.a)))) :rule cong :premises (t265.t2 t265.t3))
% 0.47/0.66  (step t265.t5 (cl (= (+ tptp.a (* (- 1) tptp.a)) 0)) :rule all_simplify)
% 0.47/0.66  (step t265.t6 (cl (= (+ (* 1 tptp.a) (* (- 1) tptp.a)) 0)) :rule trans :premises (t265.t4 t265.t5))
% 0.47/0.66  (step t265.t7 (cl (= (* 1 6) 6)) :rule all_simplify)
% 0.47/0.66  (step t265.t8 (cl (= (* (- 1) 10) (- 10))) :rule all_simplify)
% 0.47/0.66  (step t265.t9 (cl (= (+ (* 1 6) (* (- 1) 10)) (+ 6 (- 10)))) :rule cong :premises (t265.t7 t265.t8))
% 0.47/0.66  (step t265.t10 (cl (= (+ 6 (- 10)) (- 4))) :rule all_simplify)
% 0.47/0.66  (step t265.t11 (cl (= (+ (* 1 6) (* (- 1) 10)) (- 4))) :rule trans :premises (t265.t9 t265.t10))
% 0.47/0.66  (step t265.t12 (cl (= (<= (+ (* 1 tptp.a) (* (- 1) tptp.a)) (+ (* 1 6) (* (- 1) 10))) (<= 0 (- 4)))) :rule cong :premises (t265.t6 t265.t11))
% 0.47/0.66  (step t265.t13 (cl (= (<= 0 (- 4)) false)) :rule all_simplify)
% 0.47/0.66  (step t265.t14 (cl (= (<= (+ (* 1 tptp.a) (* (- 1) tptp.a)) (+ (* 1 6) (* (- 1) 10))) false)) :rule trans :premises (t265.t12 t265.t13))
% 0.47/0.66  (step t265.t15 (cl (not (= (* 1 tptp.a) (* 1 6))) (not (<= (* (- 1) tptp.a) (* (- 1) 10))) (<= (+ (* 1 tptp.a) (* (- 1) tptp.a)) (+ (* 1 6) (* (- 1) 10)))) :rule la_generic :args ((- 1) 1 1))
% 0.47/0.66  (step t265.t16 (cl (=> (and (> 1 0) (= tptp.a 6)) (= (* 1 tptp.a) (* 1 6)))) :rule la_mult_pos)
% 0.47/0.66  (step t265.t17 (cl (not (and (> 1 0) (= tptp.a 6))) (= (* 1 tptp.a) (* 1 6))) :rule implies :premises (t265.t16))
% 0.47/0.66  (step t265.t18 (cl (and (> 1 0) (= tptp.a 6)) (not (> 1 0)) (not (= tptp.a 6))) :rule and_neg)
% 0.47/0.66  (step t265.t19 (cl (= (= (> 1 0) true) (> 1 0))) :rule equiv_simplify)
% 0.47/0.66  (step t265.t20 (cl (not (= (> 1 0) true)) (> 1 0)) :rule equiv1 :premises (t265.t19))
% 0.47/0.66  (step t265.t21 (cl (= (> 1 0) true)) :rule hole :args ((> 1 0)))
% 0.47/0.66  (step t265.t22 (cl (> 1 0)) :rule resolution :premises (t265.t20 t265.t21))
% 0.47/0.66  (step t265.t23 (cl (and (> 1 0) (= tptp.a 6))) :rule resolution :premises (t265.t18 t265.t22 t265.a1))
% 0.47/0.66  (step t265.t24 (cl (= (* 1 tptp.a) (* 1 6))) :rule resolution :premises (t265.t17 t265.t23))
% 0.47/0.66  (step t265.t25 (cl (=> (and (< (- 1) 0) (>= tptp.a 10)) (<= (* (- 1) tptp.a) (* (- 1) 10)))) :rule la_mult_neg)
% 0.47/0.66  (step t265.t26 (cl (not (and (< (- 1) 0) (>= tptp.a 10))) (<= (* (- 1) tptp.a) (* (- 1) 10))) :rule implies :premises (t265.t25))
% 0.47/0.66  (step t265.t27 (cl (and (< (- 1) 0) (>= tptp.a 10)) (not (< (- 1) 0)) (not (>= tptp.a 10))) :rule and_neg)
% 0.47/0.66  (step t265.t28 (cl (= (= (< (- 1) 0) true) (< (- 1) 0))) :rule equiv_simplify)
% 0.47/0.66  (step t265.t29 (cl (not (= (< (- 1) 0) true)) (< (- 1) 0)) :rule equiv1 :premises (t265.t28))
% 0.47/0.66  (step t265.t30 (cl (= (< (- 1) 0) true)) :rule hole :args ((< (- 1) 0)))
% 0.47/0.66  (step t265.t31 (cl (< (- 1) 0)) :rule resolution :premises (t265.t29 t265.t30))
% 0.47/0.66  (step t265.t32 (cl (and (< (- 1) 0) (>= tptp.a 10))) :rule resolution :premises (t265.t27 t265.t31 t265.a0))
% 0.47/0.66  (step t265.t33 (cl (<= (* (- 1) tptp.a) (* (- 1) 10))) :rule resolution :premises (t265.t26 t265.t32))
% 0.47/0.66  (step t265.t34 (cl (<= (+ (* 1 tptp.a) (* (- 1) tptp.a)) (+ (* 1 6) (* (- 1) 10)))) :rule resolution :premises (t265.t15 t265.t24 t265.t33))
% 0.47/0.66  (step t265.t35 (cl false) :rule resolution :premises (t265.t1 t265.t14 t265.t34))
% 0.47/0.66  (step t265 (cl (not (>= tptp.a 10)) (not (= tptp.a 6)) false) :rule subproof :discharge (t265.a0 t265.a1))
% 0.47/0.66  (step t266 (cl (not (and (>= tptp.a 10) (= tptp.a 6))) (>= tptp.a 10)) :rule and_pos)
% 0.47/0.66  (step t267 (cl (not (and (>= tptp.a 10) (= tptp.a 6))) (= tptp.a 6)) :rule and_pos)
% 0.47/0.66  (step t268 (cl false (not (and (>= tptp.a 10) (= tptp.a 6))) (not (and (>= tptp.a 10) (= tptp.a 6)))) :rule resolution :premises (t265 t266 t267))
% 0.47/0.66  (step t269 (cl (not (and (>= tptp.a 10) (= tptp.a 6))) (not (and (>= tptp.a 10) (= tptp.a 6))) false) :rule reordering :premises (t268))
% 0.47/0.66  (step t270 (cl (not (and (>= tptp.a 10) (= tptp.a 6))) false) :rule contraction :premises (t269))
% 0.47/0.66  (step t271 (cl (=> (and (>= tptp.a 10) (= tptp.a 6)) false) false) :rule resolution :premises (t264 t270))
% 0.47/0.66  (step t272 (cl (=> (and (>= tptp.a 10) (= tptp.a 6)) false) (not false)) :rule implies_neg2)
% 0.47/0.66  (step t273 (cl (=> (and (>= tptp.a 10) (= tptp.a 6)) false) (=> (and (>= tptp.a 10) (= tptp.a 6)) false)) :rule resolution :premises (t271 t272))
% 0.47/0.66  (step t274 (cl (=> (and (>= tptp.a 10) (= tptp.a 6)) false)) :rule contraction :premises (t273))
% 0.47/0.66  (step t275 (cl (= (=> (and (>= tptp.a 10) (= tptp.a 6)) false) (not (and (>= tptp.a 10) (= tptp.a 6))))) :rule implies_simplify)
% 0.47/0.66  (step t276 (cl (not (=> (and (>= tptp.a 10) (= tptp.a 6)) false)) (not (and (>= tptp.a 10) (= tptp.a 6)))) :rule equiv1 :premises (t275))
% 0.47/0.66  (step t277 (cl (not (and (>= tptp.a 10) (= tptp.a 6)))) :rule resolution :premises (t274 t276))
% 0.47/0.66  (step t278 (cl (not (>= tptp.a 10)) (not (= tptp.a 6))) :rule not_and :premises (t277))
% 0.47/0.66  (step t279 (cl (=> (and (>= tptp.a 10) (= tptp.a 5)) false) (and (>= tptp.a 10) (= tptp.a 5))) :rule implies_neg1)
% 0.47/0.66  (anchor :step t280)
% 0.47/0.66  (assume t280.a0 (>= tptp.a 10))
% 0.47/0.66  (assume t280.a1 (= tptp.a 5))
% 0.47/0.66  (step t280.t1 (cl (not (= (<= (+ (* 1 tptp.a) (* (- 1) tptp.a)) (+ (* 1 5) (* (- 1) 10))) false)) (not (<= (+ (* 1 tptp.a) (* (- 1) tptp.a)) (+ (* 1 5) (* (- 1) 10)))) false) :rule equiv_pos2)
% 0.47/0.66  (step t280.t2 (cl (= (* 1 tptp.a) tptp.a)) :rule all_simplify)
% 0.47/0.66  (step t280.t3 (cl (= (* (- 1) tptp.a) (* (- 1) tptp.a))) :rule refl)
% 0.47/0.66  (step t280.t4 (cl (= (+ (* 1 tptp.a) (* (- 1) tptp.a)) (+ tptp.a (* (- 1) tptp.a)))) :rule cong :premises (t280.t2 t280.t3))
% 0.47/0.66  (step t280.t5 (cl (= (+ tptp.a (* (- 1) tptp.a)) 0)) :rule all_simplify)
% 0.47/0.66  (step t280.t6 (cl (= (+ (* 1 tptp.a) (* (- 1) tptp.a)) 0)) :rule trans :premises (t280.t4 t280.t5))
% 0.47/0.66  (step t280.t7 (cl (= (* 1 5) 5)) :rule all_simplify)
% 0.47/0.66  (step t280.t8 (cl (= (* (- 1) 10) (- 10))) :rule all_simplify)
% 0.47/0.66  (step t280.t9 (cl (= (+ (* 1 5) (* (- 1) 10)) (+ 5 (- 10)))) :rule cong :premises (t280.t7 t280.t8))
% 0.47/0.66  (step t280.t10 (cl (= (+ 5 (- 10)) (- 5))) :rule all_simplify)
% 0.47/0.66  (step t280.t11 (cl (= (+ (* 1 5) (* (- 1) 10)) (- 5))) :rule trans :premises (t280.t9 t280.t10))
% 0.47/0.66  (step t280.t12 (cl (= (<= (+ (* 1 tptp.a) (* (- 1) tptp.a)) (+ (* 1 5) (* (- 1) 10))) (<= 0 (- 5)))) :rule cong :premises (t280.t6 t280.t11))
% 0.47/0.66  (step t280.t13 (cl (= (<= 0 (- 5)) false)) :rule all_simplify)
% 0.47/0.66  (step t280.t14 (cl (= (<= (+ (* 1 tptp.a) (* (- 1) tptp.a)) (+ (* 1 5) (* (- 1) 10))) false)) :rule trans :premises (t280.t12 t280.t13))
% 0.47/0.66  (step t280.t15 (cl (not (= (* 1 tptp.a) (* 1 5))) (not (<= (* (- 1) tptp.a) (* (- 1) 10))) (<= (+ (* 1 tptp.a) (* (- 1) tptp.a)) (+ (* 1 5) (* (- 1) 10)))) :rule la_generic :args ((- 1) 1 1))
% 0.47/0.66  (step t280.t16 (cl (=> (and (> 1 0) (= tptp.a 5)) (= (* 1 tptp.a) (* 1 5)))) :rule la_mult_pos)
% 0.47/0.66  (step t280.t17 (cl (not (and (> 1 0) (= tptp.a 5))) (= (* 1 tptp.a) (* 1 5))) :rule implies :premises (t280.t16))
% 0.47/0.66  (step t280.t18 (cl (and (> 1 0) (= tptp.a 5)) (not (> 1 0)) (not (= tptp.a 5))) :rule and_neg)
% 0.47/0.66  (step t280.t19 (cl (= (= (> 1 0) true) (> 1 0))) :rule equiv_simplify)
% 0.47/0.66  (step t280.t20 (cl (not (= (> 1 0) true)) (> 1 0)) :rule equiv1 :premises (t280.t19))
% 0.47/0.66  (step t280.t21 (cl (= (> 1 0) true)) :rule hole :args ((> 1 0)))
% 0.47/0.66  (step t280.t22 (cl (> 1 0)) :rule resolution :premises (t280.t20 t280.t21))
% 0.47/0.66  (step t280.t23 (cl (and (> 1 0) (= tptp.a 5))) :rule resolution :premises (t280.t18 t280.t22 t280.a1))
% 0.47/0.66  (step t280.t24 (cl (= (* 1 tptp.a) (* 1 5))) :rule resolution :premises (t280.t17 t280.t23))
% 0.47/0.66  (step t280.t25 (cl (=> (and (< (- 1) 0) (>= tptp.a 10)) (<= (* (- 1) tptp.a) (* (- 1) 10)))) :rule la_mult_neg)
% 0.47/0.66  (step t280.t26 (cl (not (and (< (- 1) 0) (>= tptp.a 10))) (<= (* (- 1) tptp.a) (* (- 1) 10))) :rule implies :premises (t280.t25))
% 0.47/0.66  (step t280.t27 (cl (and (< (- 1) 0) (>= tptp.a 10)) (not (< (- 1) 0)) (not (>= tptp.a 10))) :rule and_neg)
% 0.47/0.66  (step t280.t28 (cl (= (= (< (- 1) 0) true) (< (- 1) 0))) :rule equiv_simplify)
% 0.47/0.66  (step t280.t29 (cl (not (= (< (- 1) 0) true)) (< (- 1) 0)) :rule equiv1 :premises (t280.t28))
% 0.47/0.66  (step t280.t30 (cl (= (< (- 1) 0) true)) :rule hole :args ((< (- 1) 0)))
% 0.47/0.66  (step t280.t31 (cl (< (- 1) 0)) :rule resolution :premises (t280.t29 t280.t30))
% 0.47/0.66  (step t280.t32 (cl (and (< (- 1) 0) (>= tptp.a 10))) :rule resolution :premises (t280.t27 t280.t31 t280.a0))
% 0.47/0.66  (step t280.t33 (cl (<= (* (- 1) tptp.a) (* (- 1) 10))) :rule resolution :premises (t280.t26 t280.t32))
% 0.47/0.66  (step t280.t34 (cl (<= (+ (* 1 tptp.a) (* (- 1) tptp.a)) (+ (* 1 5) (* (- 1) 10)))) :rule resolution :premises (t280.t15 t280.t24 t280.t33))
% 0.47/0.66  (step t280.t35 (cl false) :rule resolution :premises (t280.t1 t280.t14 t280.t34))
% 0.47/0.66  (step t280 (cl (not (>= tptp.a 10)) (not (= tptp.a 5)) false) :rule subproof :discharge (t280.a0 t280.a1))
% 0.47/0.66  (step t281 (cl (not (and (>= tptp.a 10) (= tptp.a 5))) (>= tptp.a 10)) :rule and_pos)
% 0.47/0.66  (step t282 (cl (not (and (>= tptp.a 10) (= tptp.a 5))) (= tptp.a 5)) :rule and_pos)
% 0.47/0.66  (step t283 (cl false (not (and (>= tptp.a 10) (= tptp.a 5))) (not (and (>= tptp.a 10) (= tptp.a 5)))) :rule resolution :premises (t280 t281 t282))
% 0.47/0.66  (step t284 (cl (not (and (>= tptp.a 10) (= tptp.a 5))) (not (and (>= tptp.a 10) (= tptp.a 5))) false) :rule reordering :premises (t283))
% 0.47/0.66  (step t285 (cl (not (and (>= tptp.a 10) (= tptp.a 5))) false) :rule contraction :premises (t284))
% 0.47/0.66  (step t286 (cl (=> (and (>= tptp.a 10) (= tptp.a 5)) false) false) :rule resolution :premises (t279 t285))
% 0.47/0.66  (step t287 (cl (=> (and (>= tptp.a 10) (= tptp.a 5)) false) (not false)) :rule implies_neg2)
% 0.47/0.66  (step t288 (cl (=> (and (>= tptp.a 10) (= tptp.a 5)) false) (=> (and (>= tptp.a 10) (= tptp.a 5)) false)) :rule resolution :premises (t286 t287))
% 0.47/0.66  (step t289 (cl (=> (and (>= tptp.a 10) (= tptp.a 5)) false)) :rule contraction :premises (t288))
% 0.47/0.66  (step t290 (cl (= (=> (and (>= tptp.a 10) (= tptp.a 5)) false) (not (and (>= tptp.a 10) (= tptp.a 5))))) :rule implies_simplify)
% 0.47/0.66  (step t291 (cl (not (=> (and (>= tptp.a 10) (= tptp.a 5)) false)) (not (and (>= tptp.a 10) (= tptp.a 5)))) :rule equiv1 :premises (t290))
% 0.47/0.66  (step t292 (cl (not (and (>= tptp.a 10) (= tptp.a 5)))) :rule resolution :premises (t289 t291))
% 0.47/0.66  (step t293 (cl (not (>= tptp.a 10)) (not (= tptp.a 5))) :rule not_and :premises (t292))
% 0.47/0.66  (step t294 (cl (=> (and (>= tptp.a 10) (= tptp.a 4)) false) (and (>= tptp.a 10) (= tptp.a 4))) :rule implies_neg1)
% 0.47/0.66  (anchor :step t295)
% 0.47/0.66  (assume t295.a0 (>= tptp.a 10))
% 0.47/0.66  (assume t295.a1 (= tptp.a 4))
% 0.47/0.66  (step t295.t1 (cl (not (= (<= (+ (* 1 tptp.a) (* (- 1) tptp.a)) (+ (* 1 4) (* (- 1) 10))) false)) (not (<= (+ (* 1 tptp.a) (* (- 1) tptp.a)) (+ (* 1 4) (* (- 1) 10)))) false) :rule equiv_pos2)
% 0.47/0.66  (step t295.t2 (cl (= (* 1 tptp.a) tptp.a)) :rule all_simplify)
% 0.47/0.66  (step t295.t3 (cl (= (* (- 1) tptp.a) (* (- 1) tptp.a))) :rule refl)
% 0.47/0.66  (step t295.t4 (cl (= (+ (* 1 tptp.a) (* (- 1) tptp.a)) (+ tptp.a (* (- 1) tptp.a)))) :rule cong :premises (t295.t2 t295.t3))
% 0.47/0.66  (step t295.t5 (cl (= (+ tptp.a (* (- 1) tptp.a)) 0)) :rule all_simplify)
% 0.47/0.66  (step t295.t6 (cl (= (+ (* 1 tptp.a) (* (- 1) tptp.a)) 0)) :rule trans :premises (t295.t4 t295.t5))
% 0.47/0.66  (step t295.t7 (cl (= (* 1 4) 4)) :rule all_simplify)
% 0.47/0.66  (step t295.t8 (cl (= (* (- 1) 10) (- 10))) :rule all_simplify)
% 0.47/0.66  (step t295.t9 (cl (= (+ (* 1 4) (* (- 1) 10)) (+ 4 (- 10)))) :rule cong :premises (t295.t7 t295.t8))
% 0.47/0.66  (step t295.t10 (cl (= (+ 4 (- 10)) (- 6))) :rule all_simplify)
% 0.47/0.66  (step t295.t11 (cl (= (+ (* 1 4) (* (- 1) 10)) (- 6))) :rule trans :premises (t295.t9 t295.t10))
% 0.47/0.66  (step t295.t12 (cl (= (<= (+ (* 1 tptp.a) (* (- 1) tptp.a)) (+ (* 1 4) (* (- 1) 10))) (<= 0 (- 6)))) :rule cong :premises (t295.t6 t295.t11))
% 0.47/0.66  (step t295.t13 (cl (= (<= 0 (- 6)) false)) :rule all_simplify)
% 0.47/0.66  (step t295.t14 (cl (= (<= (+ (* 1 tptp.a) (* (- 1) tptp.a)) (+ (* 1 4) (* (- 1) 10))) false)) :rule trans :premises (t295.t12 t295.t13))
% 0.47/0.66  (step t295.t15 (cl (not (= (* 1 tptp.a) (* 1 4))) (not (<= (* (- 1) tptp.a) (* (- 1) 10))) (<= (+ (* 1 tptp.a) (* (- 1) tptp.a)) (+ (* 1 4) (* (- 1) 10)))) :rule la_generic :args ((- 1) 1 1))
% 0.47/0.66  (step t295.t16 (cl (=> (and (> 1 0) (= tptp.a 4)) (= (* 1 tptp.a) (* 1 4)))) :rule la_mult_pos)
% 0.47/0.66  (step t295.t17 (cl (not (and (> 1 0) (= tptp.a 4))) (= (* 1 tptp.a) (* 1 4))) :rule implies :premises (t295.t16))
% 0.47/0.66  (step t295.t18 (cl (and (> 1 0) (= tptp.a 4)) (not (> 1 0)) (not (= tptp.a 4))) :rule and_neg)
% 0.47/0.66  (step t295.t19 (cl (= (= (> 1 0) true) (> 1 0))) :rule equiv_simplify)
% 0.47/0.66  (step t295.t20 (cl (not (= (> 1 0) true)) (> 1 0)) :rule equiv1 :premises (t295.t19))
% 0.47/0.66  (step t295.t21 (cl (= (> 1 0) true)) :rule hole :args ((> 1 0)))
% 0.47/0.66  (step t295.t22 (cl (> 1 0)) :rule resolution :premises (t295.t20 t295.t21))
% 0.47/0.66  (step t295.t23 (cl (and (> 1 0) (= tptp.a 4))) :rule resolution :premises (t295.t18 t295.t22 t295.a1))
% 0.47/0.66  (step t295.t24 (cl (= (* 1 tptp.a) (* 1 4))) :rule resolution :premises (t295.t17 t295.t23))
% 0.47/0.66  (step t295.t25 (cl (=> (and (< (- 1) 0) (>= tptp.a 10)) (<= (* (- 1) tptp.a) (* (- 1) 10)))) :rule la_mult_neg)
% 0.47/0.66  (step t295.t26 (cl (not (and (< (- 1) 0) (>= tptp.a 10))) (<= (* (- 1) tptp.a) (* (- 1) 10))) :rule implies :premises (t295.t25))
% 0.47/0.66  (step t295.t27 (cl (and (< (- 1) 0) (>= tptp.a 10)) (not (< (- 1) 0)) (not (>= tptp.a 10))) :rule and_neg)
% 0.47/0.66  (step t295.t28 (cl (= (= (< (- 1) 0) true) (< (- 1) 0))) :rule equiv_simplify)
% 0.47/0.66  (step t295.t29 (cl (not (= (< (- 1) 0) true)) (< (- 1) 0)) :rule equiv1 :premises (t295.t28))
% 0.47/0.66  (step t295.t30 (cl (= (< (- 1) 0) true)) :rule hole :args ((< (- 1) 0)))
% 0.47/0.66  (step t295.t31 (cl (< (- 1) 0)) :rule resolution :premises (t295.t29 t295.t30))
% 0.47/0.66  (step t295.t32 (cl (and (< (- 1) 0) (>= tptp.a 10))) :rule resolution :premises (t295.t27 t295.t31 t295.a0))
% 0.47/0.66  (step t295.t33 (cl (<= (* (- 1) tptp.a) (* (- 1) 10))) :rule resolution :premises (t295.t26 t295.t32))
% 0.47/0.66  (step t295.t34 (cl (<= (+ (* 1 tptp.a) (* (- 1) tptp.a)) (+ (* 1 4) (* (- 1) 10)))) :rule resolution :premises (t295.t15 t295.t24 t295.t33))
% 0.47/0.66  (step t295.t35 (cl false) :rule resolution :premises (t295.t1 t295.t14 t295.t34))
% 0.47/0.66  (step t295 (cl (not (>= tptp.a 10)) (not (= tptp.a 4)) false) :rule subproof :discharge (t295.a0 t295.a1))
% 0.47/0.66  (step t296 (cl (not (and (>= tptp.a 10) (= tptp.a 4))) (>= tptp.a 10)) :rule and_pos)
% 0.47/0.66  (step t297 (cl (not (and (>= tptp.a 10) (= tptp.a 4))) (= tptp.a 4)) :rule and_pos)
% 0.47/0.66  (step t298 (cl false (not (and (>= tptp.a 10) (= tptp.a 4))) (not (and (>= tptp.a 10) (= tptp.a 4)))) :rule resolution :premises (t295 t296 t297))
% 0.47/0.66  (step t299 (cl (not (and (>= tptp.a 10) (= tptp.a 4))) (not (and (>= tptp.a 10) (= tptp.a 4))) false) :rule reordering :premises (t298))
% 0.47/0.66  (step t300 (cl (not (and (>= tptp.a 10) (= tptp.a 4))) false) :rule contraction :premises (t299))
% 0.47/0.66  (step t301 (cl (=> (and (>= tptp.a 10) (= tptp.a 4)) false) false) :rule resolution :premises (t294 t300))
% 0.47/0.66  (step t302 (cl (=> (and (>= tptp.a 10) (= tptp.a 4)) false) (not false)) :rule implies_neg2)
% 0.47/0.66  (step t303 (cl (=> (and (>= tptp.a 10) (= tptp.a 4)) false) (=> (and (>= tptp.a 10) (= tptp.a 4)) false)) :rule resolution :premises (t301 t302))
% 0.47/0.66  (step t304 (cl (=> (and (>= tptp.a 10) (= tptp.a 4)) false)) :rule contraction :premises (t303))
% 0.47/0.66  (step t305 (cl (= (=> (and (>= tptp.a 10) (= tptp.a 4)) false) (not (and (>= tptp.a 10) (= tptp.a 4))))) :rule implies_simplify)
% 0.47/0.66  (step t306 (cl (not (=> (and (>= tptp.a 10) (= tptp.a 4)) false)) (not (and (>= tptp.a 10) (= tptp.a 4)))) :rule equiv1 :premises (t305))
% 0.47/0.66  (step t307 (cl (not (and (>= tptp.a 10) (= tptp.a 4)))) :rule resolution :premises (t304 t306))
% 0.47/0.66  (step t308 (cl (not (>= tptp.a 10)) (not (= tptp.a 4))) :rule not_and :premises (t307))
% 0.47/0.66  (step t309 (cl (=> (and (>= tptp.a 10) (= tptp.a 3)) false) (and (>= tptp.a 10) (= tptp.a 3))) :rule implies_neg1)
% 0.47/0.66  (anchor :step t310)
% 0.47/0.66  (assume t310.a0 (>= tptp.a 10))
% 0.47/0.66  (assume t310.a1 (= tptp.a 3))
% 0.47/0.66  (step t310.t1 (cl (not (= (<= (+ (* 1 tptp.a) (* (- 1) tptp.a)) (+ (* 1 3) (* (- 1) 10))) false)) (not (<= (+ (* 1 tptp.a) (* (- 1) tptp.a)) (+ (* 1 3) (* (- 1) 10)))) false) :rule equiv_pos2)
% 0.47/0.66  (step t310.t2 (cl (= (* 1 tptp.a) tptp.a)) :rule all_simplify)
% 0.47/0.66  (step t310.t3 (cl (= (* (- 1) tptp.a) (* (- 1) tptp.a))) :rule refl)
% 0.47/0.66  (step t310.t4 (cl (= (+ (* 1 tptp.a) (* (- 1) tptp.a)) (+ tptp.a (* (- 1) tptp.a)))) :rule cong :premises (t310.t2 t310.t3))
% 0.47/0.66  (step t310.t5 (cl (= (+ tptp.a (* (- 1) tptp.a)) 0)) :rule all_simplify)
% 0.47/0.66  (step t310.t6 (cl (= (+ (* 1 tptp.a) (* (- 1) tptp.a)) 0)) :rule trans :premises (t310.t4 t310.t5))
% 0.47/0.66  (step t310.t7 (cl (= (* 1 3) 3)) :rule all_simplify)
% 0.47/0.66  (step t310.t8 (cl (= (* (- 1) 10) (- 10))) :rule all_simplify)
% 0.47/0.66  (step t310.t9 (cl (= (+ (* 1 3) (* (- 1) 10)) (+ 3 (- 10)))) :rule cong :premises (t310.t7 t310.t8))
% 0.47/0.66  (step t310.t10 (cl (= (+ 3 (- 10)) (- 7))) :rule all_simplify)
% 0.47/0.66  (step t310.t11 (cl (= (+ (* 1 3) (* (- 1) 10)) (- 7))) :rule trans :premises (t310.t9 t310.t10))
% 0.47/0.66  (step t310.t12 (cl (= (<= (+ (* 1 tptp.a) (* (- 1) tptp.a)) (+ (* 1 3) (* (- 1) 10))) (<= 0 (- 7)))) :rule cong :premises (t310.t6 t310.t11))
% 0.47/0.66  (step t310.t13 (cl (= (<= 0 (- 7)) false)) :rule all_simplify)
% 0.47/0.66  (step t310.t14 (cl (= (<= (+ (* 1 tptp.a) (* (- 1) tptp.a)) (+ (* 1 3) (* (- 1) 10))) false)) :rule trans :premises (t310.t12 t310.t13))
% 0.47/0.66  (step t310.t15 (cl (not (= (* 1 tptp.a) (* 1 3))) (not (<= (* (- 1) tptp.a) (* (- 1) 10))) (<= (+ (* 1 tptp.a) (* (- 1) tptp.a)) (+ (* 1 3) (* (- 1) 10)))) :rule la_generic :args ((- 1) 1 1))
% 0.47/0.66  (step t310.t16 (cl (=> (and (> 1 0) (= tptp.a 3)) (= (* 1 tptp.a) (* 1 3)))) :rule la_mult_pos)
% 0.47/0.66  (step t310.t17 (cl (not (and (> 1 0) (= tptp.a 3))) (= (* 1 tptp.a) (* 1 3))) :rule implies :premises (t310.t16))
% 0.47/0.66  (step t310.t18 (cl (and (> 1 0) (= tptp.a 3)) (not (> 1 0)) (not (= tptp.a 3))) :rule and_neg)
% 0.47/0.66  (step t310.t19 (cl (= (= (> 1 0) true) (> 1 0))) :rule equiv_simplify)
% 0.47/0.66  (step t310.t20 (cl (not (= (> 1 0) true)) (> 1 0)) :rule equiv1 :premises (t310.t19))
% 0.47/0.66  (step t310.t21 (cl (= (> 1 0) true)) :rule hole :args ((> 1 0)))
% 0.47/0.66  (step t310.t22 (cl (> 1 0)) :rule resolution :premises (t310.t20 t310.t21))
% 0.47/0.66  (step t310.t23 (cl (and (> 1 0) (= tptp.a 3))) :rule resolution :premises (t310.t18 t310.t22 t310.a1))
% 0.47/0.66  (step t310.t24 (cl (= (* 1 tptp.a) (* 1 3))) :rule resolution :premises (t310.t17 t310.t23))
% 0.47/0.66  (step t310.t25 (cl (=> (and (< (- 1) 0) (>= tptp.a 10)) (<= (* (- 1) tptp.a) (* (- 1) 10)))) :rule la_mult_neg)
% 0.47/0.66  (step t310.t26 (cl (not (and (< (- 1) 0) (>= tptp.a 10))) (<= (* (- 1) tptp.a) (* (- 1) 10))) :rule implies :premises (t310.t25))
% 0.47/0.66  (step t310.t27 (cl (and (< (- 1) 0) (>= tptp.a 10)) (not (< (- 1) 0)) (not (>= tptp.a 10))) :rule and_neg)
% 0.47/0.66  (step t310.t28 (cl (= (= (< (- 1) 0) true) (< (- 1) 0))) :rule equiv_simplify)
% 0.47/0.66  (step t310.t29 (cl (not (= (< (- 1) 0) true)) (< (- 1) 0)) :rule equiv1 :premises (t310.t28))
% 0.47/0.66  (step t310.t30 (cl (= (< (- 1) 0) true)) :rule hole :args ((< (- 1) 0)))
% 0.47/0.66  (step t310.t31 (cl (< (- 1) 0)) :rule resolution :premises (t310.t29 t310.t30))
% 0.47/0.66  (step t310.t32 (cl (and (< (- 1) 0) (>= tptp.a 10))) :rule resolution :premises (t310.t27 t310.t31 t310.a0))
% 0.47/0.66  (step t310.t33 (cl (<= (* (- 1) tptp.a) (* (- 1) 10))) :rule resolution :premises (t310.t26 t310.t32))
% 0.47/0.66  (step t310.t34 (cl (<= (+ (* 1 tptp.a) (* (- 1) tptp.a)) (+ (* 1 3) (* (- 1) 10)))) :rule resolution :premises (t310.t15 t310.t24 t310.t33))
% 0.47/0.66  (step t310.t35 (cl false) :rule resolution :premises (t310.t1 t310.t14 t310.t34))
% 0.47/0.66  (step t310 (cl (not (>= tptp.a 10)) (not (= tptp.a 3)) false) :rule subproof :discharge (t310.a0 t310.a1))
% 0.47/0.66  (step t311 (cl (not (and (>= tptp.a 10) (= tptp.a 3))) (>= tptp.a 10)) :rule and_pos)
% 0.47/0.66  (step t312 (cl (not (and (>= tptp.a 10) (= tptp.a 3))) (= tptp.a 3)) :rule and_pos)
% 0.47/0.66  (step t313 (cl false (not (and (>= tptp.a 10) (= tptp.a 3))) (not (and (>= tptp.a 10) (= tptp.a 3)))) :rule resolution :premises (t310 t311 t312))
% 0.47/0.66  (step t314 (cl (not (and (>= tptp.a 10) (= tptp.a 3))) (not (and (>= tptp.a 10) (= tptp.a 3))) false) :rule reordering :premises (t313))
% 0.47/0.66  (step t315 (cl (not (and (>= tptp.a 10) (= tptp.a 3))) false) :rule contraction :premises (t314))
% 0.47/0.66  (step t316 (cl (=> (and (>= tptp.a 10) (= tptp.a 3)) false) false) :rule resolution :premises (t309 t315))
% 0.47/0.66  (step t317 (cl (=> (and (>= tptp.a 10) (= tptp.a 3)) false) (not false)) :rule implies_neg2)
% 0.47/0.66  (step t318 (cl (=> (and (>= tptp.a 10) (= tptp.a 3)) false) (=> (and (>= tptp.a 10) (= tptp.a 3)) false)) :rule resolution :premises (t316 t317))
% 0.47/0.66  (step t319 (cl (=> (and (>= tptp.a 10) (= tptp.a 3)) false)) :rule contraction :premises (t318))
% 0.47/0.66  (step t320 (cl (= (=> (and (>= tptp.a 10) (= tptp.a 3)) false) (not (and (>= tptp.a 10) (= tptp.a 3))))) :rule implies_simplify)
% 0.47/0.66  (step t321 (cl (not (=> (and (>= tptp.a 10) (= tptp.a 3)) false)) (not (and (>= tptp.a 10) (= tptp.a 3)))) :rule equiv1 :premises (t320))
% 0.47/0.66  (step t322 (cl (not (and (>= tptp.a 10) (= tptp.a 3)))) :rule resolution :premises (t319 t321))
% 0.47/0.66  (step t323 (cl (not (>= tptp.a 10)) (not (= tptp.a 3))) :rule not_and :premises (t322))
% 0.47/0.66  (step t324 (cl (=> (and (>= tptp.a 10) (= tptp.a 2)) false) (and (>= tptp.a 10) (= tptp.a 2))) :rule implies_neg1)
% 0.47/0.66  (anchor :step t325)
% 0.47/0.66  (assume t325.a0 (>= tptp.a 10))
% 0.47/0.66  (assume t325.a1 (= tptp.a 2))
% 0.47/0.66  (step t325.t1 (cl (not (= (<= (+ (* 1 tptp.a) (* (- 1) tptp.a)) (+ (* 1 2) (* (- 1) 10))) false)) (not (<= (+ (* 1 tptp.a) (* (- 1) tptp.a)) (+ (* 1 2) (* (- 1) 10)))) false) :rule equiv_pos2)
% 0.47/0.66  (step t325.t2 (cl (= (* 1 tptp.a) tptp.a)) :rule all_simplify)
% 0.47/0.66  (step t325.t3 (cl (= (* (- 1) tptp.a) (* (- 1) tptp.a))) :rule refl)
% 0.47/0.66  (step t325.t4 (cl (= (+ (* 1 tptp.a) (* (- 1) tptp.a)) (+ tptp.a (* (- 1) tptp.a)))) :rule cong :premises (t325.t2 t325.t3))
% 0.47/0.66  (step t325.t5 (cl (= (+ tptp.a (* (- 1) tptp.a)) 0)) :rule all_simplify)
% 0.47/0.66  (step t325.t6 (cl (= (+ (* 1 tptp.a) (* (- 1) tptp.a)) 0)) :rule trans :premises (t325.t4 t325.t5))
% 0.47/0.66  (step t325.t7 (cl (= (* 1 2) 2)) :rule all_simplify)
% 0.47/0.66  (step t325.t8 (cl (= (* (- 1) 10) (- 10))) :rule all_simplify)
% 0.47/0.66  (step t325.t9 (cl (= (+ (* 1 2) (* (- 1) 10)) (+ 2 (- 10)))) :rule cong :premises (t325.t7 t325.t8))
% 0.47/0.66  (step t325.t10 (cl (= (+ 2 (- 10)) (- 8))) :rule all_simplify)
% 0.47/0.66  (step t325.t11 (cl (= (+ (* 1 2) (* (- 1) 10)) (- 8))) :rule trans :premises (t325.t9 t325.t10))
% 0.47/0.66  (step t325.t12 (cl (= (<= (+ (* 1 tptp.a) (* (- 1) tptp.a)) (+ (* 1 2) (* (- 1) 10))) (<= 0 (- 8)))) :rule cong :premises (t325.t6 t325.t11))
% 0.47/0.66  (step t325.t13 (cl (= (<= 0 (- 8)) false)) :rule all_simplify)
% 0.47/0.66  (step t325.t14 (cl (= (<= (+ (* 1 tptp.a) (* (- 1) tptp.a)) (+ (* 1 2) (* (- 1) 10))) false)) :rule trans :premises (t325.t12 t325.t13))
% 0.47/0.66  (step t325.t15 (cl (not (= (* 1 tptp.a) (* 1 2))) (not (<= (* (- 1) tptp.a) (* (- 1) 10))) (<= (+ (* 1 tptp.a) (* (- 1) tptp.a)) (+ (* 1 2) (* (- 1) 10)))) :rule la_generic :args ((- 1) 1 1))
% 0.47/0.66  (step t325.t16 (cl (=> (and (> 1 0) (= tptp.a 2)) (= (* 1 tptp.a) (* 1 2)))) :rule la_mult_pos)
% 0.47/0.66  (step t325.t17 (cl (not (and (> 1 0) (= tptp.a 2))) (= (* 1 tptp.a) (* 1 2))) :rule implies :premises (t325.t16))
% 0.47/0.66  (step t325.t18 (cl (and (> 1 0) (= tptp.a 2)) (not (> 1 0)) (not (= tptp.a 2))) :rule and_neg)
% 0.47/0.66  (step t325.t19 (cl (= (= (> 1 0) true) (> 1 0))) :rule equiv_simplify)
% 0.47/0.66  (step t325.t20 (cl (not (= (> 1 0) true)) (> 1 0)) :rule equiv1 :premises (t325.t19))
% 0.47/0.66  (step t325.t21 (cl (= (> 1 0) true)) :rule hole :args ((> 1 0)))
% 0.47/0.66  (step t325.t22 (cl (> 1 0)) :rule resolution :premises (t325.t20 t325.t21))
% 0.47/0.66  (step t325.t23 (cl (and (> 1 0) (= tptp.a 2))) :rule resolution :premises (t325.t18 t325.t22 t325.a1))
% 0.47/0.66  (step t325.t24 (cl (= (* 1 tptp.a) (* 1 2))) :rule resolution :premises (t325.t17 t325.t23))
% 0.47/0.66  (step t325.t25 (cl (=> (and (< (- 1) 0) (>= tptp.a 10)) (<= (* (- 1) tptp.a) (* (- 1) 10)))) :rule la_mult_neg)
% 0.47/0.66  (step t325.t26 (cl (not (and (< (- 1) 0) (>= tptp.a 10))) (<= (* (- 1) tptp.a) (* (- 1) 10))) :rule implies :premises (t325.t25))
% 0.47/0.66  (step t325.t27 (cl (and (< (- 1) 0) (>= tptp.a 10)) (not (< (- 1) 0)) (not (>= tptp.a 10))) :rule and_neg)
% 0.47/0.66  (step t325.t28 (cl (= (= (< (- 1) 0) true) (< (- 1) 0))) :rule equiv_simplify)
% 0.47/0.66  (step t325.t29 (cl (not (= (< (- 1) 0) true)) (< (- 1) 0)) :rule equiv1 :premises (t325.t28))
% 0.47/0.66  (step t325.t30 (cl (= (< (- 1) 0) true)) :rule hole :args ((< (- 1) 0)))
% 0.47/0.66  (step t325.t31 (cl (< (- 1) 0)) :rule resolution :premises (t325.t29 t325.t30))
% 0.47/0.66  (step t325.t32 (cl (and (< (- 1) 0) (>= tptp.a 10))) :rule resolution :premises (t325.t27 t325.t31 t325.a0))
% 0.47/0.66  (step t325.t33 (cl (<= (* (- 1) tptp.a) (* (- 1) 10))) :rule resolution :premises (t325.t26 t325.t32))
% 0.47/0.66  (step t325.t34 (cl (<= (+ (* 1 tptp.a) (* (- 1) tptp.a)) (+ (* 1 2) (* (- 1) 10)))) :rule resolution :premises (t325.t15 t325.t24 t325.t33))
% 0.47/0.66  (step t325.t35 (cl false) :rule resolution :premises (t325.t1 t325.t14 t325.t34))
% 0.47/0.66  (step t325 (cl (not (>= tptp.a 10)) (not (= tptp.a 2)) false) :rule subproof :discharge (t325.a0 t325.a1))
% 0.47/0.66  (step t326 (cl (not (and (>= tptp.a 10) (= tptp.a 2))) (>= tptp.a 10)) :rule and_pos)
% 0.47/0.66  (step t327 (cl (not (and (>= tptp.a 10) (= tptp.a 2))) (= tptp.a 2)) :rule and_pos)
% 0.47/0.66  (step t328 (cl false (not (and (>= tptp.a 10) (= tptp.a 2))) (not (and (>= tptp.a 10) (= tptp.a 2)))) :rule resolution :premises (t325 t326 t327))
% 0.47/0.66  (step t329 (cl (not (and (>= tptp.a 10) (= tptp.a 2))) (not (and (>= tptp.a 10) (= tptp.a 2))) false) :rule reordering :premises (t328))
% 0.47/0.66  (step t330 (cl (not (and (>= tptp.a 10) (= tptp.a 2))) false) :rule contraction :premises (t329))
% 0.47/0.66  (step t331 (cl (=> (and (>= tptp.a 10) (= tptp.a 2)) false) false) :rule resolution :premises (t324 t330))
% 0.47/0.66  (step t332 (cl (=> (and (>= tptp.a 10) (= tptp.a 2)) false) (not false)) :rule implies_neg2)
% 0.47/0.66  (step t333 (cl (=> (and (>= tptp.a 10) (= tptp.a 2)) false) (=> (and (>= tptp.a 10) (= tptp.a 2)) false)) :rule resolution :premises (t331 t332))
% 0.47/0.66  (step t334 (cl (=> (and (>= tptp.a 10) (= tptp.a 2)) false)) :rule contraction :premises (t333))
% 0.47/0.66  (step t335 (cl (= (=> (and (>= tptp.a 10) (= tptp.a 2)) false) (not (and (>= tptp.a 10) (= tptp.a 2))))) :rule implies_simplify)
% 0.47/0.66  (step t336 (cl (not (=> (and (>= tptp.a 10) (= tptp.a 2)) false)) (not (and (>= tptp.a 10) (= tptp.a 2)))) :rule equiv1 :premises (t335))
% 0.47/0.66  (step t337 (cl (not (and (>= tptp.a 10) (= tptp.a 2)))) :rule resolution :premises (t334 t336))
% 0.47/0.66  (step t338 (cl (not (>= tptp.a 10)) (not (= tptp.a 2))) :rule not_and :premises (t337))
% 0.47/0.66  (step t339 (cl (=> (and (>= tptp.a 10) (= tptp.a 1)) false) (and (>= tptp.a 10) (= tptp.a 1))) :rule implies_neg1)
% 0.47/0.66  (anchor :step t340)
% 0.47/0.66  (assume t340.a0 (>= tptp.a 10))
% 0.47/0.66  (assume t340.a1 (= tptp.a 1))
% 0.47/0.66  (step t340.t1 (cl (not (= (<= (+ (* 1 tptp.a) (* (- 1) tptp.a)) (+ (* 1 1) (* (- 1) 10))) false)) (not (<= (+ (* 1 tptp.a) (* (- 1) tptp.a)) (+ (* 1 1) (* (- 1) 10)))) false) :rule equiv_pos2)
% 0.47/0.66  (step t340.t2 (cl (= (* 1 tptp.a) tptp.a)) :rule all_simplify)
% 0.47/0.66  (step t340.t3 (cl (= (* (- 1) tptp.a) (* (- 1) tptp.a))) :rule refl)
% 0.47/0.66  (step t340.t4 (cl (= (+ (* 1 tptp.a) (* (- 1) tptp.a)) (+ tptp.a (* (- 1) tptp.a)))) :rule cong :premises (t340.t2 t340.t3))
% 0.47/0.66  (step t340.t5 (cl (= (+ tptp.a (* (- 1) tptp.a)) 0)) :rule all_simplify)
% 0.47/0.66  (step t340.t6 (cl (= (+ (* 1 tptp.a) (* (- 1) tptp.a)) 0)) :rule trans :premises (t340.t4 t340.t5))
% 0.47/0.66  (step t340.t7 (cl (= (* 1 1) 1)) :rule all_simplify)
% 0.47/0.66  (step t340.t8 (cl (= (* (- 1) 10) (- 10))) :rule all_simplify)
% 0.47/0.66  (step t340.t9 (cl (= (+ (* 1 1) (* (- 1) 10)) (+ 1 (- 10)))) :rule cong :premises (t340.t7 t340.t8))
% 0.47/0.66  (step t340.t10 (cl (= (+ 1 (- 10)) (- 9))) :rule all_simplify)
% 0.47/0.66  (step t340.t11 (cl (= (+ (* 1 1) (* (- 1) 10)) (- 9))) :rule trans :premises (t340.t9 t340.t10))
% 0.47/0.66  (step t340.t12 (cl (= (<= (+ (* 1 tptp.a) (* (- 1) tptp.a)) (+ (* 1 1) (* (- 1) 10))) (<= 0 (- 9)))) :rule cong :premises (t340.t6 t340.t11))
% 0.47/0.66  (step t340.t13 (cl (= (<= 0 (- 9)) false)) :rule all_simplify)
% 0.47/0.66  (step t340.t14 (cl (= (<= (+ (* 1 tptp.a) (* (- 1) tptp.a)) (+ (* 1 1) (* (- 1) 10))) false)) :rule trans :premises (t340.t12 t340.t13))
% 0.47/0.66  (step t340.t15 (cl (not (= (* 1 tptp.a) (* 1 1))) (not (<= (* (- 1) tptp.a) (* (- 1) 10))) (<= (+ (* 1 tptp.a) (* (- 1) tptp.a)) (+ (* 1 1) (* (- 1) 10)))) :rule la_generic :args ((- 1) 1 1))
% 0.47/0.66  (step t340.t16 (cl (=> (and (> 1 0) (= tptp.a 1)) (= (* 1 tptp.a) (* 1 1)))) :rule la_mult_pos)
% 0.47/0.66  (step t340.t17 (cl (not (and (> 1 0) (= tptp.a 1))) (= (* 1 tptp.a) (* 1 1))) :rule implies :premises (t340.t16))
% 0.47/0.66  (step t340.t18 (cl (and (> 1 0) (= tptp.a 1)) (not (> 1 0)) (not (= tptp.a 1))) :rule and_neg)
% 0.47/0.66  (step t340.t19 (cl (= (= (> 1 0) true) (> 1 0))) :rule equiv_simplify)
% 0.47/0.66  (step t340.t20 (cl (not (= (> 1 0) true)) (> 1 0)) :rule equiv1 :premises (t340.t19))
% 0.47/0.66  (step t340.t21 (cl (= (> 1 0) true)) :rule hole :args ((> 1 0)))
% 0.47/0.66  (step t340.t22 (cl (> 1 0)) :rule resolution :premises (t340.t20 t340.t21))
% 0.47/0.66  (step t340.t23 (cl (and (> 1 0) (= tptp.a 1))) :rule resolution :premises (t340.t18 t340.t22 t340.a1))
% 0.47/0.66  (step t340.t24 (cl (= (* 1 tptp.a) (* 1 1))) :rule resolution :premises (t340.t17 t340.t23))
% 0.47/0.66  (step t340.t25 (cl (=> (and (< (- 1) 0) (>= tptp.a 10)) (<= (* (- 1) tptp.a) (* (- 1) 10)))) :rule la_mult_neg)
% 0.47/0.66  (step t340.t26 (cl (not (and (< (- 1) 0) (>= tptp.a 10))) (<= (* (- 1) tptp.a) (* (- 1) 10))) :rule implies :premises (t340.t25))
% 0.47/0.66  (step t340.t27 (cl (and (< (- 1) 0) (>= tptp.a 10)) (not (< (- 1) 0)) (not (>= tptp.a 10))) :rule and_neg)
% 0.47/0.66  (step t340.t28 (cl (= (= (< (- 1) 0) true) (< (- 1) 0))) :rule equiv_simplify)
% 0.47/0.66  (step t340.t29 (cl (not (= (< (- 1) 0) true)) (< (- 1) 0)) :rule equiv1 :premises (t340.t28))
% 0.47/0.66  (step t340.t30 (cl (= (< (- 1) 0) true)) :rule hole :args ((< (- 1) 0)))
% 0.47/0.66  (step t340.t31 (cl (< (- 1) 0)) :rule resolution :premises (t340.t29 t340.t30))
% 0.47/0.66  (step t340.t32 (cl (and (< (- 1) 0) (>= tptp.a 10))) :rule resolution :premises (t340.t27 t340.t31 t340.a0))
% 0.47/0.66  (step t340.t33 (cl (<= (* (- 1) tptp.a) (* (- 1) 10))) :rule resolution :premises (t340.t26 t340.t32))
% 0.47/0.66  (step t340.t34 (cl (<= (+ (* 1 tptp.a) (* (- 1) tptp.a)) (+ (* 1 1) (* (- 1) 10)))) :rule resolution :premises (t340.t15 t340.t24 t340.t33))
% 0.47/0.66  (step t340.t35 (cl false) :rule resolution :premises (t340.t1 t340.t14 t340.t34))
% 0.47/0.66  (step t340 (cl (not (>= tptp.a 10)) (not (= tptp.a 1)) false) :rule subproof :discharge (t340.a0 t340.a1))
% 0.47/0.66  (step t341 (cl (not (and (>= tptp.a 10) (= tptp.a 1))) (>= tptp.a 10)) :rule and_pos)
% 0.47/0.66  (step t342 (cl (not (and (>= tptp.a 10) (= tptp.a 1))) (= tptp.a 1)) :rule and_pos)
% 0.47/0.66  (step t343 (cl false (not (and (>= tptp.a 10) (= tptp.a 1))) (not (and (>= tptp.a 10) (= tptp.a 1)))) :rule resolution :premises (t340 t341 t342))
% 0.47/0.66  (step t344 (cl (not (and (>= tptp.a 10) (= tptp.a 1))) (not (and (>= tptp.a 10) (= tptp.a 1))) false) :rule reordering :premises (t343))
% 0.47/0.66  (step t345 (cl (not (and (>= tptp.a 10) (= tptp.a 1))) false) :rule contraction :premises (t344))
% 0.47/0.66  (step t346 (cl (=> (and (>= tptp.a 10) (= tptp.a 1)) false) false) :rule resolution :premises (t339 t345))
% 0.47/0.66  (step t347 (cl (=> (and (>= tptp.a 10) (= tptp.a 1)) false) (not false)) :rule implies_neg2)
% 0.47/0.66  (step t348 (cl (=> (and (>= tptp.a 10) (= tptp.a 1)) false) (=> (and (>= tptp.a 10) (= tptp.a 1)) false)) :rule resolution :premises (t346 t347))
% 0.47/0.66  (step t349 (cl (=> (and (>= tptp.a 10) (= tptp.a 1)) false)) :rule contraction :premises (t348))
% 0.47/0.66  (step t350 (cl (= (=> (and (>= tptp.a 10) (= tptp.a 1)) false) (not (and (>= tptp.a 10) (= tptp.a 1))))) :rule implies_simplify)
% 0.47/0.66  (step t351 (cl (not (=> (and (>= tptp.a 10) (= tptp.a 1)) false)) (not (and (>= tptp.a 10) (= tptp.a 1)))) :rule equiv1 :premises (t350))
% 0.47/0.66  (step t352 (cl (not (and (>= tptp.a 10) (= tptp.a 1)))) :rule resolution :premises (t349 t351))
% 0.47/0.66  (step t353 (cl (not (>= tptp.a 10)) (not (= tptp.a 1))) :rule not_and :premises (t352))
% 0.47/0.66  (step t354 (cl (=> (and (>= tptp.a 10) (= tptp.a 0)) false) (and (>= tptp.a 10) (= tptp.a 0))) :rule implies_neg1)
% 0.47/0.66  (anchor :step t355)
% 0.47/0.66  (assume t355.a0 (>= tptp.a 10))
% 0.47/0.66  (assume t355.a1 (= tptp.a 0))
% 0.47/0.66  (step t355.t1 (cl (not (= (<= (+ (* 1 tptp.a) (* (- 1) tptp.a)) (+ (* 1 0) (* (- 1) 10))) false)) (not (<= (+ (* 1 tptp.a) (* (- 1) tptp.a)) (+ (* 1 0) (* (- 1) 10)))) false) :rule equiv_pos2)
% 0.47/0.66  (step t355.t2 (cl (= (* 1 tptp.a) tptp.a)) :rule all_simplify)
% 0.47/0.66  (step t355.t3 (cl (= (* (- 1) tptp.a) (* (- 1) tptp.a))) :rule refl)
% 0.47/0.66  (step t355.t4 (cl (= (+ (* 1 tptp.a) (* (- 1) tptp.a)) (+ tptp.a (* (- 1) tptp.a)))) :rule cong :premises (t355.t2 t355.t3))
% 0.47/0.66  (step t355.t5 (cl (= (+ tptp.a (* (- 1) tptp.a)) 0)) :rule all_simplify)
% 0.47/0.66  (step t355.t6 (cl (= (+ (* 1 tptp.a) (* (- 1) tptp.a)) 0)) :rule trans :premises (t355.t4 t355.t5))
% 0.47/0.66  (step t355.t7 (cl (= (* 1 0) 0)) :rule all_simplify)
% 0.47/0.66  (step t355.t8 (cl (= (* (- 1) 10) (- 10))) :rule all_simplify)
% 0.47/0.66  (step t355.t9 (cl (= (+ (* 1 0) (* (- 1) 10)) (+ 0 (- 10)))) :rule cong :premises (t355.t7 t355.t8))
% 0.47/0.66  (step t355.t10 (cl (= (+ 0 (- 10)) (- 10))) :rule all_simplify)
% 0.47/0.66  (step t355.t11 (cl (= (+ (* 1 0) (* (- 1) 10)) (- 10))) :rule trans :premises (t355.t9 t355.t10))
% 0.47/0.66  (step t355.t12 (cl (= (<= (+ (* 1 tptp.a) (* (- 1) tptp.a)) (+ (* 1 0) (* (- 1) 10))) (<= 0 (- 10)))) :rule cong :premises (t355.t6 t355.t11))
% 0.47/0.66  (step t355.t13 (cl (= (<= 0 (- 10)) false)) :rule all_simplify)
% 0.47/0.66  (step t355.t14 (cl (= (<= (+ (* 1 tptp.a) (* (- 1) tptp.a)) (+ (* 1 0) (* (- 1) 10))) false)) :rule trans :premises (t355.t12 t355.t13))
% 0.47/0.66  (step t355.t15 (cl (not (= (* 1 tptp.a) (* 1 0))) (not (<= (* (- 1) tptp.a) (* (- 1) 10))) (<= (+ (* 1 tptp.a) (* (- 1) tptp.a)) (+ (* 1 0) (* (- 1) 10)))) :rule la_generic :args ((- 1) 1 1))
% 0.47/0.66  (step t355.t16 (cl (=> (and (> 1 0) (= tptp.a 0)) (= (* 1 tptp.a) (* 1 0)))) :rule la_mult_pos)
% 0.47/0.66  (step t355.t17 (cl (not (and (> 1 0) (= tptp.a 0))) (= (* 1 tptp.a) (* 1 0))) :rule implies :premises (t355.t16))
% 0.47/0.66  (step t355.t18 (cl (and (> 1 0) (= tptp.a 0)) (not (> 1 0)) (not (= tptp.a 0))) :rule and_neg)
% 0.47/0.66  (step t355.t19 (cl (= (= (> 1 0) true) (> 1 0))) :rule equiv_simplify)
% 0.47/0.66  (step t355.t20 (cl (not (= (> 1 0) true)) (> 1 0)) :rule equiv1 :premises (t355.t19))
% 0.47/0.66  (step t355.t21 (cl (= (> 1 0) true)) :rule hole :args ((> 1 0)))
% 0.47/0.66  (step t355.t22 (cl (> 1 0)) :rule resolution :premises (t355.t20 t355.t21))
% 0.47/0.66  (step t355.t23 (cl (and (> 1 0) (= tptp.a 0))) :rule resolution :premises (t355.t18 t355.t22 t355.a1))
% 0.47/0.66  (step t355.t24 (cl (= (* 1 tptp.a) (* 1 0))) :rule resolution :premises (t355.t17 t355.t23))
% 0.47/0.66  (step t355.t25 (cl (=> (and (< (- 1) 0) (>= tptp.a 10)) (<= (* (- 1) tptp.a) (* (- 1) 10)))) :rule la_mult_neg)
% 0.47/0.66  (step t355.t26 (cl (not (and (< (- 1) 0) (>= tptp.a 10))) (<= (* (- 1) tptp.a) (* (- 1) 10))) :rule implies :premises (t355.t25))
% 0.47/0.66  (step t355.t27 (cl (and (< (- 1) 0) (>= tptp.a 10)) (not (< (- 1) 0)) (not (>= tptp.a 10))) :rule and_neg)
% 0.47/0.66  (step t355.t28 (cl (= (= (< (- 1) 0) true) (< (- 1) 0))) :rule equiv_simplify)
% 0.47/0.66  (step t355.t29 (cl (not (= (< (- 1) 0) true)) (< (- 1) 0)) :rule equiv1 :premises (t355.t28))
% 0.47/0.66  (step t355.t30 (cl (= (< (- 1) 0) true)) :rule hole :args ((< (- 1) 0)))
% 0.47/0.66  (step t355.t31 (cl (< (- 1) 0)) :rule resolution :premises (t355.t29 t355.t30))
% 0.47/0.66  (step t355.t32 (cl (and (< (- 1) 0) (>= tptp.a 10))) :rule resolution :premises (t355.t27 t355.t31 t355.a0))
% 0.47/0.66  (step t355.t33 (cl (<= (* (- 1) tptp.a) (* (- 1) 10))) :rule resolution :premises (t355.t26 t355.t32))
% 0.47/0.66  (step t355.t34 (cl (<= (+ (* 1 tptp.a) (* (- 1) tptp.a)) (+ (* 1 0) (* (- 1) 10)))) :rule resolution :premises (t355.t15 t355.t24 t355.t33))
% 0.47/0.66  (step t355.t35 (cl false) :rule resolution :premises (t355.t1 t355.t14 t355.t34))
% 0.47/0.66  (step t355 (cl (not (>= tptp.a 10)) (not (= tptp.a 0)) false) :rule subproof :discharge (t355.a0 t355.a1))
% 0.47/0.66  (step t356 (cl (not (and (>= tptp.a 10) (= tptp.a 0))) (>= tptp.a 10)) :rule and_pos)
% 0.47/0.66  (step t357 (cl (not (and (>= tptp.a 10) (= tptp.a 0))) (= tptp.a 0)) :rule and_pos)
% 0.47/0.66  (step t358 (cl false (not (and (>= tptp.a 10) (= tptp.a 0))) (not (and (>= tptp.a 10) (= tptp.a 0)))) :rule resolution :premises (t355 t356 t357))
% 0.47/0.66  (step t359 (cl (not (and (>= tptp.a 10) (= tptp.a 0))) (not (and (>= tptp.a 10) (= tptp.a 0))) false) :rule reordering :premises (t358))
% 0.47/0.66  (step t360 (cl (not (and (>= tptp.a 10) (= tptp.a 0))) false) :rule contraction :premises (t359))
% 0.47/0.66  (step t361 (cl (=> (and (>= tptp.a 10) (= tptp.a 0)) false) false) :rule resolution :premises (t354 t360))
% 0.47/0.66  (step t362 (cl (=> (and (>= tptp.a 10) (= tptp.a 0)) false) (not false)) :rule implies_neg2)
% 0.47/0.66  (step t363 (cl (=> (and (>= tptp.a 10) (= tptp.a 0)) false) (=> (and (>= tptp.a 10) (= tptp.a 0)) false)) :rule resolution :premises (t361 t362))
% 0.47/0.66  (step t364 (cl (=> (and (>= tptp.a 10) (= tptp.a 0)) false)) :rule contraction :premises (t363))
% 0.47/0.66  (step t365 (cl (= (=> (and (>= tptp.a 10) (= tptp.a 0)) false) (not (and (>= tptp.a 10) (= tptp.a 0))))) :rule implies_simplify)
% 0.47/0.66  (step t366 (cl (not (=> (and (>= tptp.a 10) (= tptp.a 0)) false)) (not (and (>= tptp.a 10) (= tptp.a 0)))) :rule equiv1 :premises (t365))
% 0.47/0.66  (step t367 (cl (not (and (>= tptp.a 10) (= tptp.a 0)))) :rule resolution :premises (t364 t366))
% 0.47/0.66  (step t368 (cl (not (>= tptp.a 10)) (not (= tptp.a 0))) :rule not_and :premises (t367))
% 0.47/0.66  (step t369 (cl (= tptp.a 9) (not (or (= tptp.a 9) (= tptp.a 8) (= tptp.a 7) (= tptp.a 6) (= tptp.a 5) (= tptp.a 4) (= tptp.a 3) (= tptp.a 2) (= tptp.a 1) (= tptp.a 0))) (not (>= tptp.a 10)) (not (>= tptp.a 10)) (not (>= tptp.a 10)) (not (>= tptp.a 10)) (not (>= tptp.a 10)) (not (>= tptp.a 10)) (not (>= tptp.a 10)) (not (>= tptp.a 10)) (not (>= tptp.a 10))) :rule resolution :premises (t233 t248 t263 t278 t293 t308 t323 t338 t353 t368))
% 0.47/0.66  (step t370 (cl (= tptp.a 9) (not (or (= tptp.a 9) (= tptp.a 8) (= tptp.a 7) (= tptp.a 6) (= tptp.a 5) (= tptp.a 4) (= tptp.a 3) (= tptp.a 2) (= tptp.a 1) (= tptp.a 0))) (not (>= tptp.a 10))) :rule contraction :premises (t369))
% 0.47/0.66  (step t371 (cl (not (= (or (not (not (>= tptp.a 0))) (not (= tptp.a 8))) (or (>= tptp.a 0) (not (= tptp.a 8))))) (not (or (not (not (>= tptp.a 0))) (not (= tptp.a 8)))) (or (>= tptp.a 0) (not (= tptp.a 8)))) :rule equiv_pos2)
% 0.47/0.66  (step t372 (cl (= (not (not (>= tptp.a 0))) (>= tptp.a 0))) :rule all_simplify)
% 0.47/0.66  (step t373 (cl (= (not (= tptp.a 8)) (not (= tptp.a 8)))) :rule refl)
% 0.47/0.66  (step t374 (cl (= (or (not (not (>= tptp.a 0))) (not (= tptp.a 8))) (or (>= tptp.a 0) (not (= tptp.a 8))))) :rule cong :premises (t372 t373))
% 0.47/0.66  (step t375 (cl (=> (and (not (>= tptp.a 0)) (= tptp.a 8)) false) (and (not (>= tptp.a 0)) (= tptp.a 8))) :rule implies_neg1)
% 0.47/0.66  (anchor :step t376)
% 0.47/0.66  (assume t376.a0 (not (>= tptp.a 0)))
% 0.47/0.66  (assume t376.a1 (= tptp.a 8))
% 0.47/0.66  (step t376.t1 (cl (not (= (< (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 8) (* 1 0))) false)) (not (< (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 8) (* 1 0)))) false) :rule equiv_pos2)
% 0.47/0.66  (step t376.t2 (cl (= (< (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 8) (* 1 0))) (not (>= (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 8) (* 1 0)))))) :rule all_simplify)
% 0.47/0.66  (step t376.t3 (cl (= (* (- 1) tptp.a) (* (- 1) tptp.a))) :rule refl)
% 0.47/0.66  (step t376.t4 (cl (= (* 1 tptp.a) tptp.a)) :rule all_simplify)
% 0.47/0.66  (step t376.t5 (cl (= (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) tptp.a) tptp.a))) :rule cong :premises (t376.t3 t376.t4))
% 0.47/0.66  (step t376.t6 (cl (= (+ (* (- 1) tptp.a) tptp.a) 0)) :rule all_simplify)
% 0.47/0.66  (step t376.t7 (cl (= (+ (* (- 1) tptp.a) (* 1 tptp.a)) 0)) :rule trans :premises (t376.t5 t376.t6))
% 0.47/0.66  (step t376.t8 (cl (= (* (- 1) 8) (- 8))) :rule all_simplify)
% 0.47/0.66  (step t376.t9 (cl (= (* 1 0) 0)) :rule all_simplify)
% 0.47/0.66  (step t376.t10 (cl (= (+ (* (- 1) 8) (* 1 0)) (+ (- 8) 0))) :rule cong :premises (t376.t8 t376.t9))
% 0.47/0.66  (step t376.t11 (cl (= (+ (- 8) 0) (- 8))) :rule all_simplify)
% 0.47/0.66  (step t376.t12 (cl (= (+ (* (- 1) 8) (* 1 0)) (- 8))) :rule trans :premises (t376.t10 t376.t11))
% 0.47/0.66  (step t376.t13 (cl (= (>= (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 8) (* 1 0))) (>= 0 (- 8)))) :rule cong :premises (t376.t7 t376.t12))
% 0.47/0.66  (step t376.t14 (cl (= (>= 0 (- 8)) true)) :rule all_simplify)
% 0.47/0.66  (step t376.t15 (cl (= (>= (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 8) (* 1 0))) true)) :rule trans :premises (t376.t13 t376.t14))
% 0.47/0.66  (step t376.t16 (cl (= (not (>= (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 8) (* 1 0)))) (not true))) :rule cong :premises (t376.t15))
% 0.47/0.66  (step t376.t17 (cl (= (not true) false)) :rule all_simplify)
% 0.47/0.66  (step t376.t18 (cl (= (not (>= (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 8) (* 1 0)))) false)) :rule trans :premises (t376.t16 t376.t17))
% 0.47/0.66  (step t376.t19 (cl (= (< (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 8) (* 1 0))) false)) :rule trans :premises (t376.t2 t376.t18))
% 0.47/0.66  (step t376.t20 (cl (not (= (* (- 1) tptp.a) (* (- 1) 8))) (not (< (* 1 tptp.a) (* 1 0))) (< (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 8) (* 1 0)))) :rule la_generic :args ((- 1) 1 1))
% 0.47/0.66  (step t376.t21 (cl (=> (and (< (- 1) 0) (= tptp.a 8)) (= (* (- 1) tptp.a) (* (- 1) 8)))) :rule la_mult_neg)
% 0.47/0.66  (step t376.t22 (cl (not (and (< (- 1) 0) (= tptp.a 8))) (= (* (- 1) tptp.a) (* (- 1) 8))) :rule implies :premises (t376.t21))
% 0.47/0.66  (step t376.t23 (cl (and (< (- 1) 0) (= tptp.a 8)) (not (< (- 1) 0)) (not (= tptp.a 8))) :rule and_neg)
% 0.47/0.66  (step t376.t24 (cl (= (= (< (- 1) 0) true) (< (- 1) 0))) :rule equiv_simplify)
% 0.47/0.66  (step t376.t25 (cl (not (= (< (- 1) 0) true)) (< (- 1) 0)) :rule equiv1 :premises (t376.t24))
% 0.47/0.66  (step t376.t26 (cl (= (< (- 1) 0) true)) :rule hole :args ((< (- 1) 0)))
% 0.47/0.66  (step t376.t27 (cl (< (- 1) 0)) :rule resolution :premises (t376.t25 t376.t26))
% 0.47/0.66  (step t376.t28 (cl (and (< (- 1) 0) (= tptp.a 8))) :rule resolution :premises (t376.t23 t376.t27 t376.a1))
% 0.47/0.66  (step t376.t29 (cl (= (* (- 1) tptp.a) (* (- 1) 8))) :rule resolution :premises (t376.t22 t376.t28))
% 0.47/0.66  (step t376.t30 (cl (=> (and (> 1 0) (< tptp.a 0)) (< (* 1 tptp.a) (* 1 0)))) :rule la_mult_pos)
% 0.47/0.66  (step t376.t31 (cl (not (and (> 1 0) (< tptp.a 0))) (< (* 1 tptp.a) (* 1 0))) :rule implies :premises (t376.t30))
% 0.47/0.66  (step t376.t32 (cl (and (> 1 0) (< tptp.a 0)) (not (> 1 0)) (not (< tptp.a 0))) :rule and_neg)
% 0.47/0.66  (step t376.t33 (cl (= (= (> 1 0) true) (> 1 0))) :rule equiv_simplify)
% 0.47/0.66  (step t376.t34 (cl (not (= (> 1 0) true)) (> 1 0)) :rule equiv1 :premises (t376.t33))
% 0.47/0.66  (step t376.t35 (cl (= (> 1 0) true)) :rule hole :args ((> 1 0)))
% 0.47/0.66  (step t376.t36 (cl (> 1 0)) :rule resolution :premises (t376.t34 t376.t35))
% 0.47/0.66  (step t376.t37 (cl (not (= (not (>= tptp.a 0)) (< tptp.a 0))) (not (not (>= tptp.a 0))) (< tptp.a 0)) :rule equiv_pos2)
% 0.47/0.66  (step t376.t38 (cl (= (< tptp.a 0) (not (>= tptp.a 0)))) :rule all_simplify)
% 0.47/0.66  (step t376.t39 (cl (= (not (>= tptp.a 0)) (< tptp.a 0))) :rule symm :premises (t376.t38))
% 0.47/0.66  (step t376.t40 (cl (< tptp.a 0)) :rule resolution :premises (t376.t37 t376.t39 t376.a0))
% 0.47/0.66  (step t376.t41 (cl (and (> 1 0) (< tptp.a 0))) :rule resolution :premises (t376.t32 t376.t36 t376.t40))
% 0.47/0.66  (step t376.t42 (cl (< (* 1 tptp.a) (* 1 0))) :rule resolution :premises (t376.t31 t376.t41))
% 0.47/0.66  (step t376.t43 (cl (< (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 8) (* 1 0)))) :rule resolution :premises (t376.t20 t376.t29 t376.t42))
% 0.47/0.66  (step t376.t44 (cl false) :rule resolution :premises (t376.t1 t376.t19 t376.t43))
% 0.47/0.66  (step t376 (cl (not (not (>= tptp.a 0))) (not (= tptp.a 8)) false) :rule subproof :discharge (t376.a0 t376.a1))
% 0.47/0.66  (step t377 (cl (not (and (not (>= tptp.a 0)) (= tptp.a 8))) (not (>= tptp.a 0))) :rule and_pos)
% 0.47/0.66  (step t378 (cl (not (and (not (>= tptp.a 0)) (= tptp.a 8))) (= tptp.a 8)) :rule and_pos)
% 0.47/0.66  (step t379 (cl false (not (and (not (>= tptp.a 0)) (= tptp.a 8))) (not (and (not (>= tptp.a 0)) (= tptp.a 8)))) :rule resolution :premises (t376 t377 t378))
% 0.47/0.66  (step t380 (cl (not (and (not (>= tptp.a 0)) (= tptp.a 8))) (not (and (not (>= tptp.a 0)) (= tptp.a 8))) false) :rule reordering :premises (t379))
% 0.47/0.66  (step t381 (cl (not (and (not (>= tptp.a 0)) (= tptp.a 8))) false) :rule contraction :premises (t380))
% 0.47/0.66  (step t382 (cl (=> (and (not (>= tptp.a 0)) (= tptp.a 8)) false) false) :rule resolution :premises (t375 t381))
% 0.47/0.66  (step t383 (cl (=> (and (not (>= tptp.a 0)) (= tptp.a 8)) false) (not false)) :rule implies_neg2)
% 0.47/0.66  (step t384 (cl (=> (and (not (>= tptp.a 0)) (= tptp.a 8)) false) (=> (and (not (>= tptp.a 0)) (= tptp.a 8)) false)) :rule resolution :premises (t382 t383))
% 0.47/0.66  (step t385 (cl (=> (and (not (>= tptp.a 0)) (= tptp.a 8)) false)) :rule contraction :premises (t384))
% 0.47/0.66  (step t386 (cl (= (=> (and (not (>= tptp.a 0)) (= tptp.a 8)) false) (not (and (not (>= tptp.a 0)) (= tptp.a 8))))) :rule implies_simplify)
% 0.47/0.66  (step t387 (cl (not (=> (and (not (>= tptp.a 0)) (= tptp.a 8)) false)) (not (and (not (>= tptp.a 0)) (= tptp.a 8)))) :rule equiv1 :premises (t386))
% 0.47/0.66  (step t388 (cl (not (and (not (>= tptp.a 0)) (= tptp.a 8)))) :rule resolution :premises (t385 t387))
% 0.47/0.66  (step t389 (cl (not (not (>= tptp.a 0))) (not (= tptp.a 8))) :rule not_and :premises (t388))
% 0.47/0.66  (step t390 (cl (or (not (not (>= tptp.a 0))) (not (= tptp.a 8))) (not (not (not (>= tptp.a 0))))) :rule or_neg)
% 0.47/0.66  (step t391 (cl (or (not (not (>= tptp.a 0))) (not (= tptp.a 8))) (not (not (= tptp.a 8)))) :rule or_neg)
% 0.47/0.66  (step t392 (cl (or (not (not (>= tptp.a 0))) (not (= tptp.a 8))) (or (not (not (>= tptp.a 0))) (not (= tptp.a 8)))) :rule resolution :premises (t389 t390 t391))
% 0.47/0.66  (step t393 (cl (or (not (not (>= tptp.a 0))) (not (= tptp.a 8)))) :rule contraction :premises (t392))
% 0.47/0.66  (step t394 (cl (or (>= tptp.a 0) (not (= tptp.a 8)))) :rule resolution :premises (t371 t374 t393))
% 0.47/0.66  (step t395 (cl (>= tptp.a 0) (not (= tptp.a 8))) :rule or :premises (t394))
% 0.47/0.66  (step t396 (cl (not (= (or (not (not (>= tptp.a 0))) (not (= tptp.a 7))) (or (>= tptp.a 0) (not (= tptp.a 7))))) (not (or (not (not (>= tptp.a 0))) (not (= tptp.a 7)))) (or (>= tptp.a 0) (not (= tptp.a 7)))) :rule equiv_pos2)
% 0.47/0.66  (step t397 (cl (= (not (= tptp.a 7)) (not (= tptp.a 7)))) :rule refl)
% 0.47/0.66  (step t398 (cl (= (or (not (not (>= tptp.a 0))) (not (= tptp.a 7))) (or (>= tptp.a 0) (not (= tptp.a 7))))) :rule cong :premises (t372 t397))
% 0.47/0.66  (step t399 (cl (=> (and (not (>= tptp.a 0)) (= tptp.a 7)) false) (and (not (>= tptp.a 0)) (= tptp.a 7))) :rule implies_neg1)
% 0.47/0.66  (anchor :step t400)
% 0.47/0.66  (assume t400.a0 (not (>= tptp.a 0)))
% 0.47/0.66  (assume t400.a1 (= tptp.a 7))
% 0.47/0.66  (step t400.t1 (cl (not (= (< (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 7) (* 1 0))) false)) (not (< (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 7) (* 1 0)))) false) :rule equiv_pos2)
% 0.47/0.66  (step t400.t2 (cl (= (< (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 7) (* 1 0))) (not (>= (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 7) (* 1 0)))))) :rule all_simplify)
% 0.47/0.66  (step t400.t3 (cl (= (* (- 1) tptp.a) (* (- 1) tptp.a))) :rule refl)
% 0.47/0.66  (step t400.t4 (cl (= (* 1 tptp.a) tptp.a)) :rule all_simplify)
% 0.47/0.66  (step t400.t5 (cl (= (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) tptp.a) tptp.a))) :rule cong :premises (t400.t3 t400.t4))
% 0.47/0.66  (step t400.t6 (cl (= (+ (* (- 1) tptp.a) tptp.a) 0)) :rule all_simplify)
% 0.47/0.66  (step t400.t7 (cl (= (+ (* (- 1) tptp.a) (* 1 tptp.a)) 0)) :rule trans :premises (t400.t5 t400.t6))
% 0.47/0.66  (step t400.t8 (cl (= (* (- 1) 7) (- 7))) :rule all_simplify)
% 0.47/0.66  (step t400.t9 (cl (= (* 1 0) 0)) :rule all_simplify)
% 0.47/0.66  (step t400.t10 (cl (= (+ (* (- 1) 7) (* 1 0)) (+ (- 7) 0))) :rule cong :premises (t400.t8 t400.t9))
% 0.47/0.66  (step t400.t11 (cl (= (+ (- 7) 0) (- 7))) :rule all_simplify)
% 0.47/0.66  (step t400.t12 (cl (= (+ (* (- 1) 7) (* 1 0)) (- 7))) :rule trans :premises (t400.t10 t400.t11))
% 0.47/0.66  (step t400.t13 (cl (= (>= (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 7) (* 1 0))) (>= 0 (- 7)))) :rule cong :premises (t400.t7 t400.t12))
% 0.47/0.66  (step t400.t14 (cl (= (>= 0 (- 7)) true)) :rule all_simplify)
% 0.47/0.66  (step t400.t15 (cl (= (>= (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 7) (* 1 0))) true)) :rule trans :premises (t400.t13 t400.t14))
% 0.47/0.66  (step t400.t16 (cl (= (not (>= (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 7) (* 1 0)))) (not true))) :rule cong :premises (t400.t15))
% 0.47/0.66  (step t400.t17 (cl (= (not true) false)) :rule all_simplify)
% 0.47/0.66  (step t400.t18 (cl (= (not (>= (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 7) (* 1 0)))) false)) :rule trans :premises (t400.t16 t400.t17))
% 0.47/0.66  (step t400.t19 (cl (= (< (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 7) (* 1 0))) false)) :rule trans :premises (t400.t2 t400.t18))
% 0.47/0.66  (step t400.t20 (cl (not (= (* (- 1) tptp.a) (* (- 1) 7))) (not (< (* 1 tptp.a) (* 1 0))) (< (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 7) (* 1 0)))) :rule la_generic :args ((- 1) 1 1))
% 0.47/0.66  (step t400.t21 (cl (=> (and (< (- 1) 0) (= tptp.a 7)) (= (* (- 1) tptp.a) (* (- 1) 7)))) :rule la_mult_neg)
% 0.47/0.66  (step t400.t22 (cl (not (and (< (- 1) 0) (= tptp.a 7))) (= (* (- 1) tptp.a) (* (- 1) 7))) :rule implies :premises (t400.t21))
% 0.47/0.66  (step t400.t23 (cl (and (< (- 1) 0) (= tptp.a 7)) (not (< (- 1) 0)) (not (= tptp.a 7))) :rule and_neg)
% 0.47/0.66  (step t400.t24 (cl (= (= (< (- 1) 0) true) (< (- 1) 0))) :rule equiv_simplify)
% 0.47/0.66  (step t400.t25 (cl (not (= (< (- 1) 0) true)) (< (- 1) 0)) :rule equiv1 :premises (t400.t24))
% 0.47/0.66  (step t400.t26 (cl (= (< (- 1) 0) true)) :rule hole :args ((< (- 1) 0)))
% 0.47/0.66  (step t400.t27 (cl (< (- 1) 0)) :rule resolution :premises (t400.t25 t400.t26))
% 0.47/0.66  (step t400.t28 (cl (and (< (- 1) 0) (= tptp.a 7))) :rule resolution :premises (t400.t23 t400.t27 t400.a1))
% 0.47/0.66  (step t400.t29 (cl (= (* (- 1) tptp.a) (* (- 1) 7))) :rule resolution :premises (t400.t22 t400.t28))
% 0.47/0.66  (step t400.t30 (cl (=> (and (> 1 0) (< tptp.a 0)) (< (* 1 tptp.a) (* 1 0)))) :rule la_mult_pos)
% 0.47/0.66  (step t400.t31 (cl (not (and (> 1 0) (< tptp.a 0))) (< (* 1 tptp.a) (* 1 0))) :rule implies :premises (t400.t30))
% 0.47/0.66  (step t400.t32 (cl (and (> 1 0) (< tptp.a 0)) (not (> 1 0)) (not (< tptp.a 0))) :rule and_neg)
% 0.47/0.66  (step t400.t33 (cl (= (= (> 1 0) true) (> 1 0))) :rule equiv_simplify)
% 0.47/0.66  (step t400.t34 (cl (not (= (> 1 0) true)) (> 1 0)) :rule equiv1 :premises (t400.t33))
% 0.47/0.66  (step t400.t35 (cl (= (> 1 0) true)) :rule hole :args ((> 1 0)))
% 0.47/0.66  (step t400.t36 (cl (> 1 0)) :rule resolution :premises (t400.t34 t400.t35))
% 0.47/0.66  (step t400.t37 (cl (not (= (not (>= tptp.a 0)) (< tptp.a 0))) (not (not (>= tptp.a 0))) (< tptp.a 0)) :rule equiv_pos2)
% 0.47/0.66  (step t400.t38 (cl (= (< tptp.a 0) (not (>= tptp.a 0)))) :rule all_simplify)
% 0.47/0.66  (step t400.t39 (cl (= (not (>= tptp.a 0)) (< tptp.a 0))) :rule symm :premises (t400.t38))
% 0.47/0.66  (step t400.t40 (cl (< tptp.a 0)) :rule resolution :premises (t400.t37 t400.t39 t400.a0))
% 0.47/0.66  (step t400.t41 (cl (and (> 1 0) (< tptp.a 0))) :rule resolution :premises (t400.t32 t400.t36 t400.t40))
% 0.47/0.66  (step t400.t42 (cl (< (* 1 tptp.a) (* 1 0))) :rule resolution :premises (t400.t31 t400.t41))
% 0.47/0.66  (step t400.t43 (cl (< (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 7) (* 1 0)))) :rule resolution :premises (t400.t20 t400.t29 t400.t42))
% 0.47/0.66  (step t400.t44 (cl false) :rule resolution :premises (t400.t1 t400.t19 t400.t43))
% 0.47/0.66  (step t400 (cl (not (not (>= tptp.a 0))) (not (= tptp.a 7)) false) :rule subproof :discharge (t400.a0 t400.a1))
% 0.47/0.66  (step t401 (cl (not (and (not (>= tptp.a 0)) (= tptp.a 7))) (not (>= tptp.a 0))) :rule and_pos)
% 0.47/0.66  (step t402 (cl (not (and (not (>= tptp.a 0)) (= tptp.a 7))) (= tptp.a 7)) :rule and_pos)
% 0.47/0.66  (step t403 (cl false (not (and (not (>= tptp.a 0)) (= tptp.a 7))) (not (and (not (>= tptp.a 0)) (= tptp.a 7)))) :rule resolution :premises (t400 t401 t402))
% 0.47/0.66  (step t404 (cl (not (and (not (>= tptp.a 0)) (= tptp.a 7))) (not (and (not (>= tptp.a 0)) (= tptp.a 7))) false) :rule reordering :premises (t403))
% 0.47/0.66  (step t405 (cl (not (and (not (>= tptp.a 0)) (= tptp.a 7))) false) :rule contraction :premises (t404))
% 0.47/0.66  (step t406 (cl (=> (and (not (>= tptp.a 0)) (= tptp.a 7)) false) false) :rule resolution :premises (t399 t405))
% 0.47/0.66  (step t407 (cl (=> (and (not (>= tptp.a 0)) (= tptp.a 7)) false) (not false)) :rule implies_neg2)
% 0.47/0.66  (step t408 (cl (=> (and (not (>= tptp.a 0)) (= tptp.a 7)) false) (=> (and (not (>= tptp.a 0)) (= tptp.a 7)) false)) :rule resolution :premises (t406 t407))
% 0.47/0.66  (step t409 (cl (=> (and (not (>= tptp.a 0)) (= tptp.a 7)) false)) :rule contraction :premises (t408))
% 0.47/0.66  (step t410 (cl (= (=> (and (not (>= tptp.a 0)) (= tptp.a 7)) false) (not (and (not (>= tptp.a 0)) (= tptp.a 7))))) :rule implies_simplify)
% 0.47/0.66  (step t411 (cl (not (=> (and (not (>= tptp.a 0)) (= tptp.a 7)) false)) (not (and (not (>= tptp.a 0)) (= tptp.a 7)))) :rule equiv1 :premises (t410))
% 0.47/0.66  (step t412 (cl (not (and (not (>= tptp.a 0)) (= tptp.a 7)))) :rule resolution :premises (t409 t411))
% 0.47/0.66  (step t413 (cl (not (not (>= tptp.a 0))) (not (= tptp.a 7))) :rule not_and :premises (t412))
% 0.47/0.66  (step t414 (cl (or (not (not (>= tptp.a 0))) (not (= tptp.a 7))) (not (not (not (>= tptp.a 0))))) :rule or_neg)
% 0.47/0.66  (step t415 (cl (or (not (not (>= tptp.a 0))) (not (= tptp.a 7))) (not (not (= tptp.a 7)))) :rule or_neg)
% 0.47/0.66  (step t416 (cl (or (not (not (>= tptp.a 0))) (not (= tptp.a 7))) (or (not (not (>= tptp.a 0))) (not (= tptp.a 7)))) :rule resolution :premises (t413 t414 t415))
% 0.47/0.66  (step t417 (cl (or (not (not (>= tptp.a 0))) (not (= tptp.a 7)))) :rule contraction :premises (t416))
% 0.47/0.66  (step t418 (cl (or (>= tptp.a 0) (not (= tptp.a 7)))) :rule resolution :premises (t396 t398 t417))
% 0.47/0.66  (step t419 (cl (>= tptp.a 0) (not (= tptp.a 7))) :rule or :premises (t418))
% 0.47/0.66  (step t420 (cl (not (= (or (not (not (>= tptp.a 0))) (not (= tptp.a 6))) (or (>= tptp.a 0) (not (= tptp.a 6))))) (not (or (not (not (>= tptp.a 0))) (not (= tptp.a 6)))) (or (>= tptp.a 0) (not (= tptp.a 6)))) :rule equiv_pos2)
% 0.47/0.66  (step t421 (cl (= (not (= tptp.a 6)) (not (= tptp.a 6)))) :rule refl)
% 0.47/0.66  (step t422 (cl (= (or (not (not (>= tptp.a 0))) (not (= tptp.a 6))) (or (>= tptp.a 0) (not (= tptp.a 6))))) :rule cong :premises (t372 t421))
% 0.47/0.66  (step t423 (cl (=> (and (not (>= tptp.a 0)) (= tptp.a 6)) false) (and (not (>= tptp.a 0)) (= tptp.a 6))) :rule implies_neg1)
% 0.47/0.66  (anchor :step t424)
% 0.47/0.66  (assume t424.a0 (not (>= tptp.a 0)))
% 0.47/0.66  (assume t424.a1 (= tptp.a 6))
% 0.47/0.66  (step t424.t1 (cl (not (= (< (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 6) (* 1 0))) false)) (not (< (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 6) (* 1 0)))) false) :rule equiv_pos2)
% 0.47/0.66  (step t424.t2 (cl (= (< (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 6) (* 1 0))) (not (>= (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 6) (* 1 0)))))) :rule all_simplify)
% 0.47/0.66  (step t424.t3 (cl (= (* (- 1) tptp.a) (* (- 1) tptp.a))) :rule refl)
% 0.47/0.66  (step t424.t4 (cl (= (* 1 tptp.a) tptp.a)) :rule all_simplify)
% 0.47/0.66  (step t424.t5 (cl (= (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) tptp.a) tptp.a))) :rule cong :premises (t424.t3 t424.t4))
% 0.47/0.66  (step t424.t6 (cl (= (+ (* (- 1) tptp.a) tptp.a) 0)) :rule all_simplify)
% 0.47/0.66  (step t424.t7 (cl (= (+ (* (- 1) tptp.a) (* 1 tptp.a)) 0)) :rule trans :premises (t424.t5 t424.t6))
% 0.47/0.66  (step t424.t8 (cl (= (* (- 1) 6) (- 6))) :rule all_simplify)
% 0.47/0.66  (step t424.t9 (cl (= (* 1 0) 0)) :rule all_simplify)
% 0.47/0.66  (step t424.t10 (cl (= (+ (* (- 1) 6) (* 1 0)) (+ (- 6) 0))) :rule cong :premises (t424.t8 t424.t9))
% 0.47/0.66  (step t424.t11 (cl (= (+ (- 6) 0) (- 6))) :rule all_simplify)
% 0.47/0.66  (step t424.t12 (cl (= (+ (* (- 1) 6) (* 1 0)) (- 6))) :rule trans :premises (t424.t10 t424.t11))
% 0.47/0.66  (step t424.t13 (cl (= (>= (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 6) (* 1 0))) (>= 0 (- 6)))) :rule cong :premises (t424.t7 t424.t12))
% 0.47/0.66  (step t424.t14 (cl (= (>= 0 (- 6)) true)) :rule all_simplify)
% 0.47/0.66  (step t424.t15 (cl (= (>= (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 6) (* 1 0))) true)) :rule trans :premises (t424.t13 t424.t14))
% 0.47/0.66  (step t424.t16 (cl (= (not (>= (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 6) (* 1 0)))) (not true))) :rule cong :premises (t424.t15))
% 0.47/0.66  (step t424.t17 (cl (= (not true) false)) :rule all_simplify)
% 0.47/0.66  (step t424.t18 (cl (= (not (>= (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 6) (* 1 0)))) false)) :rule trans :premises (t424.t16 t424.t17))
% 0.47/0.66  (step t424.t19 (cl (= (< (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 6) (* 1 0))) false)) :rule trans :premises (t424.t2 t424.t18))
% 0.47/0.66  (step t424.t20 (cl (not (= (* (- 1) tptp.a) (* (- 1) 6))) (not (< (* 1 tptp.a) (* 1 0))) (< (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 6) (* 1 0)))) :rule la_generic :args ((- 1) 1 1))
% 0.47/0.66  (step t424.t21 (cl (=> (and (< (- 1) 0) (= tptp.a 6)) (= (* (- 1) tptp.a) (* (- 1) 6)))) :rule la_mult_neg)
% 0.47/0.66  (step t424.t22 (cl (not (and (< (- 1) 0) (= tptp.a 6))) (= (* (- 1) tptp.a) (* (- 1) 6))) :rule implies :premises (t424.t21))
% 0.47/0.66  (step t424.t23 (cl (and (< (- 1) 0) (= tptp.a 6)) (not (< (- 1) 0)) (not (= tptp.a 6))) :rule and_neg)
% 0.47/0.66  (step t424.t24 (cl (= (= (< (- 1) 0) true) (< (- 1) 0))) :rule equiv_simplify)
% 0.47/0.66  (step t424.t25 (cl (not (= (< (- 1) 0) true)) (< (- 1) 0)) :rule equiv1 :premises (t424.t24))
% 0.47/0.66  (step t424.t26 (cl (= (< (- 1) 0) true)) :rule hole :args ((< (- 1) 0)))
% 0.47/0.66  (step t424.t27 (cl (< (- 1) 0)) :rule resolution :premises (t424.t25 t424.t26))
% 0.47/0.66  (step t424.t28 (cl (and (< (- 1) 0) (= tptp.a 6))) :rule resolution :premises (t424.t23 t424.t27 t424.a1))
% 0.47/0.66  (step t424.t29 (cl (= (* (- 1) tptp.a) (* (- 1) 6))) :rule resolution :premises (t424.t22 t424.t28))
% 0.47/0.66  (step t424.t30 (cl (=> (and (> 1 0) (< tptp.a 0)) (< (* 1 tptp.a) (* 1 0)))) :rule la_mult_pos)
% 0.47/0.66  (step t424.t31 (cl (not (and (> 1 0) (< tptp.a 0))) (< (* 1 tptp.a) (* 1 0))) :rule implies :premises (t424.t30))
% 0.47/0.66  (step t424.t32 (cl (and (> 1 0) (< tptp.a 0)) (not (> 1 0)) (not (< tptp.a 0))) :rule and_neg)
% 0.47/0.66  (step t424.t33 (cl (= (= (> 1 0) true) (> 1 0))) :rule equiv_simplify)
% 0.47/0.66  (step t424.t34 (cl (not (= (> 1 0) true)) (> 1 0)) :rule equiv1 :premises (t424.t33))
% 0.47/0.66  (step t424.t35 (cl (= (> 1 0) true)) :rule hole :args ((> 1 0)))
% 0.47/0.66  (step t424.t36 (cl (> 1 0)) :rule resolution :premises (t424.t34 t424.t35))
% 0.47/0.66  (step t424.t37 (cl (not (= (not (>= tptp.a 0)) (< tptp.a 0))) (not (not (>= tptp.a 0))) (< tptp.a 0)) :rule equiv_pos2)
% 0.47/0.66  (step t424.t38 (cl (= (< tptp.a 0) (not (>= tptp.a 0)))) :rule all_simplify)
% 0.47/0.66  (step t424.t39 (cl (= (not (>= tptp.a 0)) (< tptp.a 0))) :rule symm :premises (t424.t38))
% 0.47/0.66  (step t424.t40 (cl (< tptp.a 0)) :rule resolution :premises (t424.t37 t424.t39 t424.a0))
% 0.47/0.66  (step t424.t41 (cl (and (> 1 0) (< tptp.a 0))) :rule resolution :premises (t424.t32 t424.t36 t424.t40))
% 0.47/0.66  (step t424.t42 (cl (< (* 1 tptp.a) (* 1 0))) :rule resolution :premises (t424.t31 t424.t41))
% 0.47/0.66  (step t424.t43 (cl (< (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 6) (* 1 0)))) :rule resolution :premises (t424.t20 t424.t29 t424.t42))
% 0.47/0.66  (step t424.t44 (cl false) :rule resolution :premises (t424.t1 t424.t19 t424.t43))
% 0.47/0.66  (step t424 (cl (not (not (>= tptp.a 0))) (not (= tptp.a 6)) false) :rule subproof :discharge (t424.a0 t424.a1))
% 0.47/0.66  (step t425 (cl (not (and (not (>= tptp.a 0)) (= tptp.a 6))) (not (>= tptp.a 0))) :rule and_pos)
% 0.47/0.66  (step t426 (cl (not (and (not (>= tptp.a 0)) (= tptp.a 6))) (= tptp.a 6)) :rule and_pos)
% 0.47/0.66  (step t427 (cl false (not (and (not (>= tptp.a 0)) (= tptp.a 6))) (not (and (not (>= tptp.a 0)) (= tptp.a 6)))) :rule resolution :premises (t424 t425 t426))
% 0.47/0.66  (step t428 (cl (not (and (not (>= tptp.a 0)) (= tptp.a 6))) (not (and (not (>= tptp.a 0)) (= tptp.a 6))) false) :rule reordering :premises (t427))
% 0.47/0.66  (step t429 (cl (not (and (not (>= tptp.a 0)) (= tptp.a 6))) false) :rule contraction :premises (t428))
% 0.47/0.66  (step t430 (cl (=> (and (not (>= tptp.a 0)) (= tptp.a 6)) false) false) :rule resolution :premises (t423 t429))
% 0.47/0.66  (step t431 (cl (=> (and (not (>= tptp.a 0)) (= tptp.a 6)) false) (not false)) :rule implies_neg2)
% 0.47/0.66  (step t432 (cl (=> (and (not (>= tptp.a 0)) (= tptp.a 6)) false) (=> (and (not (>= tptp.a 0)) (= tptp.a 6)) false)) :rule resolution :premises (t430 t431))
% 0.47/0.66  (step t433 (cl (=> (and (not (>= tptp.a 0)) (= tptp.a 6)) false)) :rule contraction :premises (t432))
% 0.47/0.66  (step t434 (cl (= (=> (and (not (>= tptp.a 0)) (= tptp.a 6)) false) (not (and (not (>= tptp.a 0)) (= tptp.a 6))))) :rule implies_simplify)
% 0.47/0.66  (step t435 (cl (not (=> (and (not (>= tptp.a 0)) (= tptp.a 6)) false)) (not (and (not (>= tptp.a 0)) (= tptp.a 6)))) :rule equiv1 :premises (t434))
% 0.47/0.66  (step t436 (cl (not (and (not (>= tptp.a 0)) (= tptp.a 6)))) :rule resolution :premises (t433 t435))
% 0.47/0.66  (step t437 (cl (not (not (>= tptp.a 0))) (not (= tptp.a 6))) :rule not_and :premises (t436))
% 0.47/0.66  (step t438 (cl (or (not (not (>= tptp.a 0))) (not (= tptp.a 6))) (not (not (not (>= tptp.a 0))))) :rule or_neg)
% 0.47/0.66  (step t439 (cl (or (not (not (>= tptp.a 0))) (not (= tptp.a 6))) (not (not (= tptp.a 6)))) :rule or_neg)
% 0.47/0.66  (step t440 (cl (or (not (not (>= tptp.a 0))) (not (= tptp.a 6))) (or (not (not (>= tptp.a 0))) (not (= tptp.a 6)))) :rule resolution :premises (t437 t438 t439))
% 0.47/0.66  (step t441 (cl (or (not (not (>= tptp.a 0))) (not (= tptp.a 6)))) :rule contraction :premises (t440))
% 0.47/0.66  (step t442 (cl (or (>= tptp.a 0) (not (= tptp.a 6)))) :rule resolution :premises (t420 t422 t441))
% 0.47/0.66  (step t443 (cl (>= tptp.a 0) (not (= tptp.a 6))) :rule or :premises (t442))
% 0.47/0.66  (step t444 (cl (not (= (or (not (not (>= tptp.a 0))) (not (= tptp.a 5))) (or (>= tptp.a 0) (not (= tptp.a 5))))) (not (or (not (not (>= tptp.a 0))) (not (= tptp.a 5)))) (or (>= tptp.a 0) (not (= tptp.a 5)))) :rule equiv_pos2)
% 0.47/0.66  (step t445 (cl (= (not (= tptp.a 5)) (not (= tptp.a 5)))) :rule refl)
% 0.47/0.66  (step t446 (cl (= (or (not (not (>= tptp.a 0))) (not (= tptp.a 5))) (or (>= tptp.a 0) (not (= tptp.a 5))))) :rule cong :premises (t372 t445))
% 0.47/0.66  (step t447 (cl (=> (and (not (>= tptp.a 0)) (= tptp.a 5)) false) (and (not (>= tptp.a 0)) (= tptp.a 5))) :rule implies_neg1)
% 0.47/0.66  (anchor :step t448)
% 0.47/0.66  (assume t448.a0 (not (>= tptp.a 0)))
% 0.47/0.66  (assume t448.a1 (= tptp.a 5))
% 0.47/0.66  (step t448.t1 (cl (not (= (< (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 5) (* 1 0))) false)) (not (< (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 5) (* 1 0)))) false) :rule equiv_pos2)
% 0.47/0.66  (step t448.t2 (cl (= (< (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 5) (* 1 0))) (not (>= (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 5) (* 1 0)))))) :rule all_simplify)
% 0.47/0.66  (step t448.t3 (cl (= (* (- 1) tptp.a) (* (- 1) tptp.a))) :rule refl)
% 0.47/0.66  (step t448.t4 (cl (= (* 1 tptp.a) tptp.a)) :rule all_simplify)
% 0.47/0.66  (step t448.t5 (cl (= (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) tptp.a) tptp.a))) :rule cong :premises (t448.t3 t448.t4))
% 0.47/0.66  (step t448.t6 (cl (= (+ (* (- 1) tptp.a) tptp.a) 0)) :rule all_simplify)
% 0.47/0.66  (step t448.t7 (cl (= (+ (* (- 1) tptp.a) (* 1 tptp.a)) 0)) :rule trans :premises (t448.t5 t448.t6))
% 0.47/0.66  (step t448.t8 (cl (= (* (- 1) 5) (- 5))) :rule all_simplify)
% 0.47/0.66  (step t448.t9 (cl (= (* 1 0) 0)) :rule all_simplify)
% 0.47/0.66  (step t448.t10 (cl (= (+ (* (- 1) 5) (* 1 0)) (+ (- 5) 0))) :rule cong :premises (t448.t8 t448.t9))
% 0.47/0.66  (step t448.t11 (cl (= (+ (- 5) 0) (- 5))) :rule all_simplify)
% 0.47/0.66  (step t448.t12 (cl (= (+ (* (- 1) 5) (* 1 0)) (- 5))) :rule trans :premises (t448.t10 t448.t11))
% 0.47/0.66  (step t448.t13 (cl (= (>= (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 5) (* 1 0))) (>= 0 (- 5)))) :rule cong :premises (t448.t7 t448.t12))
% 0.47/0.66  (step t448.t14 (cl (= (>= 0 (- 5)) true)) :rule all_simplify)
% 0.47/0.66  (step t448.t15 (cl (= (>= (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 5) (* 1 0))) true)) :rule trans :premises (t448.t13 t448.t14))
% 0.47/0.66  (step t448.t16 (cl (= (not (>= (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 5) (* 1 0)))) (not true))) :rule cong :premises (t448.t15))
% 0.47/0.66  (step t448.t17 (cl (= (not true) false)) :rule all_simplify)
% 0.47/0.66  (step t448.t18 (cl (= (not (>= (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 5) (* 1 0)))) false)) :rule trans :premises (t448.t16 t448.t17))
% 0.47/0.66  (step t448.t19 (cl (= (< (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 5) (* 1 0))) false)) :rule trans :premises (t448.t2 t448.t18))
% 0.47/0.66  (step t448.t20 (cl (not (= (* (- 1) tptp.a) (* (- 1) 5))) (not (< (* 1 tptp.a) (* 1 0))) (< (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 5) (* 1 0)))) :rule la_generic :args ((- 1) 1 1))
% 0.47/0.66  (step t448.t21 (cl (=> (and (< (- 1) 0) (= tptp.a 5)) (= (* (- 1) tptp.a) (* (- 1) 5)))) :rule la_mult_neg)
% 0.47/0.66  (step t448.t22 (cl (not (and (< (- 1) 0) (= tptp.a 5))) (= (* (- 1) tptp.a) (* (- 1) 5))) :rule implies :premises (t448.t21))
% 0.47/0.66  (step t448.t23 (cl (and (< (- 1) 0) (= tptp.a 5)) (not (< (- 1) 0)) (not (= tptp.a 5))) :rule and_neg)
% 0.47/0.66  (step t448.t24 (cl (= (= (< (- 1) 0) true) (< (- 1) 0))) :rule equiv_simplify)
% 0.47/0.66  (step t448.t25 (cl (not (= (< (- 1) 0) true)) (< (- 1) 0)) :rule equiv1 :premises (t448.t24))
% 0.47/0.66  (step t448.t26 (cl (= (< (- 1) 0) true)) :rule hole :args ((< (- 1) 0)))
% 0.47/0.66  (step t448.t27 (cl (< (- 1) 0)) :rule resolution :premises (t448.t25 t448.t26))
% 0.47/0.66  (step t448.t28 (cl (and (< (- 1) 0) (= tptp.a 5))) :rule resolution :premises (t448.t23 t448.t27 t448.a1))
% 0.47/0.66  (step t448.t29 (cl (= (* (- 1) tptp.a) (* (- 1) 5))) :rule resolution :premises (t448.t22 t448.t28))
% 0.47/0.66  (step t448.t30 (cl (=> (and (> 1 0) (< tptp.a 0)) (< (* 1 tptp.a) (* 1 0)))) :rule la_mult_pos)
% 0.47/0.66  (step t448.t31 (cl (not (and (> 1 0) (< tptp.a 0))) (< (* 1 tptp.a) (* 1 0))) :rule implies :premises (t448.t30))
% 0.47/0.66  (step t448.t32 (cl (and (> 1 0) (< tptp.a 0)) (not (> 1 0)) (not (< tptp.a 0))) :rule and_neg)
% 0.47/0.66  (step t448.t33 (cl (= (= (> 1 0) true) (> 1 0))) :rule equiv_simplify)
% 0.47/0.66  (step t448.t34 (cl (not (= (> 1 0) true)) (> 1 0)) :rule equiv1 :premises (t448.t33))
% 0.47/0.66  (step t448.t35 (cl (= (> 1 0) true)) :rule hole :args ((> 1 0)))
% 0.47/0.66  (step t448.t36 (cl (> 1 0)) :rule resolution :premises (t448.t34 t448.t35))
% 0.47/0.66  (step t448.t37 (cl (not (= (not (>= tptp.a 0)) (< tptp.a 0))) (not (not (>= tptp.a 0))) (< tptp.a 0)) :rule equiv_pos2)
% 0.47/0.66  (step t448.t38 (cl (= (< tptp.a 0) (not (>= tptp.a 0)))) :rule all_simplify)
% 0.47/0.66  (step t448.t39 (cl (= (not (>= tptp.a 0)) (< tptp.a 0))) :rule symm :premises (t448.t38))
% 0.47/0.66  (step t448.t40 (cl (< tptp.a 0)) :rule resolution :premises (t448.t37 t448.t39 t448.a0))
% 0.47/0.66  (step t448.t41 (cl (and (> 1 0) (< tptp.a 0))) :rule resolution :premises (t448.t32 t448.t36 t448.t40))
% 0.47/0.66  (step t448.t42 (cl (< (* 1 tptp.a) (* 1 0))) :rule resolution :premises (t448.t31 t448.t41))
% 0.47/0.66  (step t448.t43 (cl (< (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 5) (* 1 0)))) :rule resolution :premises (t448.t20 t448.t29 t448.t42))
% 0.47/0.66  (step t448.t44 (cl false) :rule resolution :premises (t448.t1 t448.t19 t448.t43))
% 0.47/0.66  (step t448 (cl (not (not (>= tptp.a 0))) (not (= tptp.a 5)) false) :rule subproof :discharge (t448.a0 t448.a1))
% 0.47/0.66  (step t449 (cl (not (and (not (>= tptp.a 0)) (= tptp.a 5))) (not (>= tptp.a 0))) :rule and_pos)
% 0.47/0.66  (step t450 (cl (not (and (not (>= tptp.a 0)) (= tptp.a 5))) (= tptp.a 5)) :rule and_pos)
% 0.47/0.66  (step t451 (cl false (not (and (not (>= tptp.a 0)) (= tptp.a 5))) (not (and (not (>= tptp.a 0)) (= tptp.a 5)))) :rule resolution :premises (t448 t449 t450))
% 0.47/0.66  (step t452 (cl (not (and (not (>= tptp.a 0)) (= tptp.a 5))) (not (and (not (>= tptp.a 0)) (= tptp.a 5))) false) :rule reordering :premises (t451))
% 0.47/0.66  (step t453 (cl (not (and (not (>= tptp.a 0)) (= tptp.a 5))) false) :rule contraction :premises (t452))
% 0.47/0.66  (step t454 (cl (=> (and (not (>= tptp.a 0)) (= tptp.a 5)) false) false) :rule resolution :premises (t447 t453))
% 0.47/0.66  (step t455 (cl (=> (and (not (>= tptp.a 0)) (= tptp.a 5)) false) (not false)) :rule implies_neg2)
% 0.47/0.66  (step t456 (cl (=> (and (not (>= tptp.a 0)) (= tptp.a 5)) false) (=> (and (not (>= tptp.a 0)) (= tptp.a 5)) false)) :rule resolution :premises (t454 t455))
% 0.47/0.66  (step t457 (cl (=> (and (not (>= tptp.a 0)) (= tptp.a 5)) false)) :rule contraction :premises (t456))
% 0.47/0.66  (step t458 (cl (= (=> (and (not (>= tptp.a 0)) (= tptp.a 5)) false) (not (and (not (>= tptp.a 0)) (= tptp.a 5))))) :rule implies_simplify)
% 0.47/0.66  (step t459 (cl (not (=> (and (not (>= tptp.a 0)) (= tptp.a 5)) false)) (not (and (not (>= tptp.a 0)) (= tptp.a 5)))) :rule equiv1 :premises (t458))
% 0.47/0.66  (step t460 (cl (not (and (not (>= tptp.a 0)) (= tptp.a 5)))) :rule resolution :premises (t457 t459))
% 0.47/0.66  (step t461 (cl (not (not (>= tptp.a 0))) (not (= tptp.a 5))) :rule not_and :premises (t460))
% 0.47/0.66  (step t462 (cl (or (not (not (>= tptp.a 0))) (not (= tptp.a 5))) (not (not (not (>= tptp.a 0))))) :rule or_neg)
% 0.47/0.66  (step t463 (cl (or (not (not (>= tptp.a 0))) (not (= tptp.a 5))) (not (not (= tptp.a 5)))) :rule or_neg)
% 0.47/0.66  (step t464 (cl (or (not (not (>= tptp.a 0))) (not (= tptp.a 5))) (or (not (not (>= tptp.a 0))) (not (= tptp.a 5)))) :rule resolution :premises (t461 t462 t463))
% 0.47/0.66  (step t465 (cl (or (not (not (>= tptp.a 0))) (not (= tptp.a 5)))) :rule contraction :premises (t464))
% 0.47/0.66  (step t466 (cl (or (>= tptp.a 0) (not (= tptp.a 5)))) :rule resolution :premises (t444 t446 t465))
% 0.47/0.66  (step t467 (cl (>= tptp.a 0) (not (= tptp.a 5))) :rule or :premises (t466))
% 0.47/0.66  (step t468 (cl (not (= (or (not (not (>= tptp.a 0))) (not (= tptp.a 4))) (or (>= tptp.a 0) (not (= tptp.a 4))))) (not (or (not (not (>= tptp.a 0))) (not (= tptp.a 4)))) (or (>= tptp.a 0) (not (= tptp.a 4)))) :rule equiv_pos2)
% 0.47/0.66  (step t469 (cl (= (not (= tptp.a 4)) (not (= tptp.a 4)))) :rule refl)
% 0.47/0.66  (step t470 (cl (= (or (not (not (>= tptp.a 0))) (not (= tptp.a 4))) (or (>= tptp.a 0) (not (= tptp.a 4))))) :rule cong :premises (t372 t469))
% 0.47/0.66  (step t471 (cl (=> (and (not (>= tptp.a 0)) (= tptp.a 4)) false) (and (not (>= tptp.a 0)) (= tptp.a 4))) :rule implies_neg1)
% 0.47/0.66  (anchor :step t472)
% 0.47/0.66  (assume t472.a0 (not (>= tptp.a 0)))
% 0.47/0.66  (assume t472.a1 (= tptp.a 4))
% 0.47/0.66  (step t472.t1 (cl (not (= (< (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 4) (* 1 0))) false)) (not (< (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 4) (* 1 0)))) false) :rule equiv_pos2)
% 0.47/0.66  (step t472.t2 (cl (= (< (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 4) (* 1 0))) (not (>= (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 4) (* 1 0)))))) :rule all_simplify)
% 0.47/0.66  (step t472.t3 (cl (= (* (- 1) tptp.a) (* (- 1) tptp.a))) :rule refl)
% 0.47/0.66  (step t472.t4 (cl (= (* 1 tptp.a) tptp.a)) :rule all_simplify)
% 0.47/0.66  (step t472.t5 (cl (= (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) tptp.a) tptp.a))) :rule cong :premises (t472.t3 t472.t4))
% 0.47/0.66  (step t472.t6 (cl (= (+ (* (- 1) tptp.a) tptp.a) 0)) :rule all_simplify)
% 0.47/0.66  (step t472.t7 (cl (= (+ (* (- 1) tptp.a) (* 1 tptp.a)) 0)) :rule trans :premises (t472.t5 t472.t6))
% 0.47/0.66  (step t472.t8 (cl (= (* (- 1) 4) (- 4))) :rule all_simplify)
% 0.47/0.66  (step t472.t9 (cl (= (* 1 0) 0)) :rule all_simplify)
% 0.47/0.66  (step t472.t10 (cl (= (+ (* (- 1) 4) (* 1 0)) (+ (- 4) 0))) :rule cong :premises (t472.t8 t472.t9))
% 0.47/0.66  (step t472.t11 (cl (= (+ (- 4) 0) (- 4))) :rule all_simplify)
% 0.47/0.66  (step t472.t12 (cl (= (+ (* (- 1) 4) (* 1 0)) (- 4))) :rule trans :premises (t472.t10 t472.t11))
% 0.47/0.66  (step t472.t13 (cl (= (>= (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 4) (* 1 0))) (>= 0 (- 4)))) :rule cong :premises (t472.t7 t472.t12))
% 0.47/0.66  (step t472.t14 (cl (= (>= 0 (- 4)) true)) :rule all_simplify)
% 0.47/0.66  (step t472.t15 (cl (= (>= (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 4) (* 1 0))) true)) :rule trans :premises (t472.t13 t472.t14))
% 0.47/0.66  (step t472.t16 (cl (= (not (>= (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 4) (* 1 0)))) (not true))) :rule cong :premises (t472.t15))
% 0.47/0.66  (step t472.t17 (cl (= (not true) false)) :rule all_simplify)
% 0.47/0.66  (step t472.t18 (cl (= (not (>= (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 4) (* 1 0)))) false)) :rule trans :premises (t472.t16 t472.t17))
% 0.47/0.66  (step t472.t19 (cl (= (< (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 4) (* 1 0))) false)) :rule trans :premises (t472.t2 t472.t18))
% 0.47/0.66  (step t472.t20 (cl (not (= (* (- 1) tptp.a) (* (- 1) 4))) (not (< (* 1 tptp.a) (* 1 0))) (< (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 4) (* 1 0)))) :rule la_generic :args ((- 1) 1 1))
% 0.47/0.66  (step t472.t21 (cl (=> (and (< (- 1) 0) (= tptp.a 4)) (= (* (- 1) tptp.a) (* (- 1) 4)))) :rule la_mult_neg)
% 0.47/0.66  (step t472.t22 (cl (not (and (< (- 1) 0) (= tptp.a 4))) (= (* (- 1) tptp.a) (* (- 1) 4))) :rule implies :premises (t472.t21))
% 0.47/0.66  (step t472.t23 (cl (and (< (- 1) 0) (= tptp.a 4)) (not (< (- 1) 0)) (not (= tptp.a 4))) :rule and_neg)
% 0.47/0.66  (step t472.t24 (cl (= (= (< (- 1) 0) true) (< (- 1) 0))) :rule equiv_simplify)
% 0.47/0.66  (step t472.t25 (cl (not (= (< (- 1) 0) true)) (< (- 1) 0)) :rule equiv1 :premises (t472.t24))
% 0.47/0.66  (step t472.t26 (cl (= (< (- 1) 0) true)) :rule hole :args ((< (- 1) 0)))
% 0.47/0.66  (step t472.t27 (cl (< (- 1) 0)) :rule resolution :premises (t472.t25 t472.t26))
% 0.47/0.66  (step t472.t28 (cl (and (< (- 1) 0) (= tptp.a 4))) :rule resolution :premises (t472.t23 t472.t27 t472.a1))
% 0.47/0.66  (step t472.t29 (cl (= (* (- 1) tptp.a) (* (- 1) 4))) :rule resolution :premises (t472.t22 t472.t28))
% 0.47/0.66  (step t472.t30 (cl (=> (and (> 1 0) (< tptp.a 0)) (< (* 1 tptp.a) (* 1 0)))) :rule la_mult_pos)
% 0.47/0.66  (step t472.t31 (cl (not (and (> 1 0) (< tptp.a 0))) (< (* 1 tptp.a) (* 1 0))) :rule implies :premises (t472.t30))
% 0.47/0.66  (step t472.t32 (cl (and (> 1 0) (< tptp.a 0)) (not (> 1 0)) (not (< tptp.a 0))) :rule and_neg)
% 0.47/0.66  (step t472.t33 (cl (= (= (> 1 0) true) (> 1 0))) :rule equiv_simplify)
% 0.47/0.66  (step t472.t34 (cl (not (= (> 1 0) true)) (> 1 0)) :rule equiv1 :premises (t472.t33))
% 0.47/0.66  (step t472.t35 (cl (= (> 1 0) true)) :rule hole :args ((> 1 0)))
% 0.47/0.66  (step t472.t36 (cl (> 1 0)) :rule resolution :premises (t472.t34 t472.t35))
% 0.47/0.66  (step t472.t37 (cl (not (= (not (>= tptp.a 0)) (< tptp.a 0))) (not (not (>= tptp.a 0))) (< tptp.a 0)) :rule equiv_pos2)
% 0.47/0.66  (step t472.t38 (cl (= (< tptp.a 0) (not (>= tptp.a 0)))) :rule all_simplify)
% 0.47/0.66  (step t472.t39 (cl (= (not (>= tptp.a 0)) (< tptp.a 0))) :rule symm :premises (t472.t38))
% 0.47/0.66  (step t472.t40 (cl (< tptp.a 0)) :rule resolution :premises (t472.t37 t472.t39 t472.a0))
% 0.47/0.66  (step t472.t41 (cl (and (> 1 0) (< tptp.a 0))) :rule resolution :premises (t472.t32 t472.t36 t472.t40))
% 0.47/0.66  (step t472.t42 (cl (< (* 1 tptp.a) (* 1 0))) :rule resolution :premises (t472.t31 t472.t41))
% 0.47/0.66  (step t472.t43 (cl (< (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 4) (* 1 0)))) :rule resolution :premises (t472.t20 t472.t29 t472.t42))
% 0.47/0.66  (step t472.t44 (cl false) :rule resolution :premises (t472.t1 t472.t19 t472.t43))
% 0.47/0.66  (step t472 (cl (not (not (>= tptp.a 0))) (not (= tptp.a 4)) false) :rule subproof :discharge (t472.a0 t472.a1))
% 0.47/0.66  (step t473 (cl (not (and (not (>= tptp.a 0)) (= tptp.a 4))) (not (>= tptp.a 0))) :rule and_pos)
% 0.47/0.66  (step t474 (cl (not (and (not (>= tptp.a 0)) (= tptp.a 4))) (= tptp.a 4)) :rule and_pos)
% 0.47/0.66  (step t475 (cl false (not (and (not (>= tptp.a 0)) (= tptp.a 4))) (not (and (not (>= tptp.a 0)) (= tptp.a 4)))) :rule resolution :premises (t472 t473 t474))
% 0.47/0.66  (step t476 (cl (not (and (not (>= tptp.a 0)) (= tptp.a 4))) (not (and (not (>= tptp.a 0)) (= tptp.a 4))) false) :rule reordering :premises (t475))
% 0.47/0.66  (step t477 (cl (not (and (not (>= tptp.a 0)) (= tptp.a 4))) false) :rule contraction :premises (t476))
% 0.47/0.66  (step t478 (cl (=> (and (not (>= tptp.a 0)) (= tptp.a 4)) false) false) :rule resolution :premises (t471 t477))
% 0.47/0.66  (step t479 (cl (=> (and (not (>= tptp.a 0)) (= tptp.a 4)) false) (not false)) :rule implies_neg2)
% 0.47/0.66  (step t480 (cl (=> (and (not (>= tptp.a 0)) (= tptp.a 4)) false) (=> (and (not (>= tptp.a 0)) (= tptp.a 4)) false)) :rule resolution :premises (t478 t479))
% 0.47/0.66  (step t481 (cl (=> (and (not (>= tptp.a 0)) (= tptp.a 4)) false)) :rule contraction :premises (t480))
% 0.47/0.66  (step t482 (cl (= (=> (and (not (>= tptp.a 0)) (= tptp.a 4)) false) (not (and (not (>= tptp.a 0)) (= tptp.a 4))))) :rule implies_simplify)
% 0.47/0.66  (step t483 (cl (not (=> (and (not (>= tptp.a 0)) (= tptp.a 4)) false)) (not (and (not (>= tptp.a 0)) (= tptp.a 4)))) :rule equiv1 :premises (t482))
% 0.47/0.66  (step t484 (cl (not (and (not (>= tptp.a 0)) (= tptp.a 4)))) :rule resolution :premises (t481 t483))
% 0.47/0.66  (step t485 (cl (not (not (>= tptp.a 0))) (not (= tptp.a 4))) :rule not_and :premises (t484))
% 0.47/0.66  (step t486 (cl (or (not (not (>= tptp.a 0))) (not (= tptp.a 4))) (not (not (not (>= tptp.a 0))))) :rule or_neg)
% 0.47/0.66  (step t487 (cl (or (not (not (>= tptp.a 0))) (not (= tptp.a 4))) (not (not (= tptp.a 4)))) :rule or_neg)
% 0.47/0.66  (step t488 (cl (or (not (not (>= tptp.a 0))) (not (= tptp.a 4))) (or (not (not (>= tptp.a 0))) (not (= tptp.a 4)))) :rule resolution :premises (t485 t486 t487))
% 0.47/0.66  (step t489 (cl (or (not (not (>= tptp.a 0))) (not (= tptp.a 4)))) :rule contraction :premises (t488))
% 0.47/0.66  (step t490 (cl (or (>= tptp.a 0) (not (= tptp.a 4)))) :rule resolution :premises (t468 t470 t489))
% 0.47/0.66  (step t491 (cl (>= tptp.a 0) (not (= tptp.a 4))) :rule or :premises (t490))
% 0.47/0.66  (step t492 (cl (not (= (or (not (not (>= tptp.a 0))) (not (= tptp.a 3))) (or (>= tptp.a 0) (not (= tptp.a 3))))) (not (or (not (not (>= tptp.a 0))) (not (= tptp.a 3)))) (or (>= tptp.a 0) (not (= tptp.a 3)))) :rule equiv_pos2)
% 0.47/0.66  (step t493 (cl (= (not (= tptp.a 3)) (not (= tptp.a 3)))) :rule refl)
% 0.47/0.66  (step t494 (cl (= (or (not (not (>= tptp.a 0))) (not (= tptp.a 3))) (or (>= tptp.a 0) (not (= tptp.a 3))))) :rule cong :premises (t372 t493))
% 0.47/0.66  (step t495 (cl (=> (and (not (>= tptp.a 0)) (= tptp.a 3)) false) (and (not (>= tptp.a 0)) (= tptp.a 3))) :rule implies_neg1)
% 0.47/0.66  (anchor :step t496)
% 0.47/0.66  (assume t496.a0 (not (>= tptp.a 0)))
% 0.47/0.66  (assume t496.a1 (= tptp.a 3))
% 0.47/0.66  (step t496.t1 (cl (not (= (< (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 3) (* 1 0))) false)) (not (< (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 3) (* 1 0)))) false) :rule equiv_pos2)
% 0.47/0.66  (step t496.t2 (cl (= (< (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 3) (* 1 0))) (not (>= (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 3) (* 1 0)))))) :rule all_simplify)
% 0.47/0.66  (step t496.t3 (cl (= (* (- 1) tptp.a) (* (- 1) tptp.a))) :rule refl)
% 0.47/0.66  (step t496.t4 (cl (= (* 1 tptp.a) tptp.a)) :rule all_simplify)
% 0.47/0.66  (step t496.t5 (cl (= (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) tptp.a) tptp.a))) :rule cong :premises (t496.t3 t496.t4))
% 0.47/0.66  (step t496.t6 (cl (= (+ (* (- 1) tptp.a) tptp.a) 0)) :rule all_simplify)
% 0.47/0.66  (step t496.t7 (cl (= (+ (* (- 1) tptp.a) (* 1 tptp.a)) 0)) :rule trans :premises (t496.t5 t496.t6))
% 0.47/0.66  (step t496.t8 (cl (= (* (- 1) 3) (- 3))) :rule all_simplify)
% 0.47/0.66  (step t496.t9 (cl (= (* 1 0) 0)) :rule all_simplify)
% 0.47/0.66  (step t496.t10 (cl (= (+ (* (- 1) 3) (* 1 0)) (+ (- 3) 0))) :rule cong :premises (t496.t8 t496.t9))
% 0.47/0.66  (step t496.t11 (cl (= (+ (- 3) 0) (- 3))) :rule all_simplify)
% 0.47/0.66  (step t496.t12 (cl (= (+ (* (- 1) 3) (* 1 0)) (- 3))) :rule trans :premises (t496.t10 t496.t11))
% 0.47/0.66  (step t496.t13 (cl (= (>= (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 3) (* 1 0))) (>= 0 (- 3)))) :rule cong :premises (t496.t7 t496.t12))
% 0.47/0.66  (step t496.t14 (cl (= (>= 0 (- 3)) true)) :rule all_simplify)
% 0.47/0.66  (step t496.t15 (cl (= (>= (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 3) (* 1 0))) true)) :rule trans :premises (t496.t13 t496.t14))
% 0.47/0.66  (step t496.t16 (cl (= (not (>= (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 3) (* 1 0)))) (not true))) :rule cong :premises (t496.t15))
% 0.47/0.66  (step t496.t17 (cl (= (not true) false)) :rule all_simplify)
% 0.47/0.66  (step t496.t18 (cl (= (not (>= (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 3) (* 1 0)))) false)) :rule trans :premises (t496.t16 t496.t17))
% 0.47/0.66  (step t496.t19 (cl (= (< (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 3) (* 1 0))) false)) :rule trans :premises (t496.t2 t496.t18))
% 0.47/0.66  (step t496.t20 (cl (not (= (* (- 1) tptp.a) (* (- 1) 3))) (not (< (* 1 tptp.a) (* 1 0))) (< (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 3) (* 1 0)))) :rule la_generic :args ((- 1) 1 1))
% 0.47/0.66  (step t496.t21 (cl (=> (and (< (- 1) 0) (= tptp.a 3)) (= (* (- 1) tptp.a) (* (- 1) 3)))) :rule la_mult_neg)
% 0.47/0.66  (step t496.t22 (cl (not (and (< (- 1) 0) (= tptp.a 3))) (= (* (- 1) tptp.a) (* (- 1) 3))) :rule implies :premises (t496.t21))
% 0.47/0.66  (step t496.t23 (cl (and (< (- 1) 0) (= tptp.a 3)) (not (< (- 1) 0)) (not (= tptp.a 3))) :rule and_neg)
% 0.47/0.66  (step t496.t24 (cl (= (= (< (- 1) 0) true) (< (- 1) 0))) :rule equiv_simplify)
% 0.47/0.66  (step t496.t25 (cl (not (= (< (- 1) 0) true)) (< (- 1) 0)) :rule equiv1 :premises (t496.t24))
% 0.47/0.66  (step t496.t26 (cl (= (< (- 1) 0) true)) :rule hole :args ((< (- 1) 0)))
% 0.47/0.66  (step t496.t27 (cl (< (- 1) 0)) :rule resolution :premises (t496.t25 t496.t26))
% 0.47/0.66  (step t496.t28 (cl (and (< (- 1) 0) (= tptp.a 3))) :rule resolution :premises (t496.t23 t496.t27 t496.a1))
% 0.47/0.66  (step t496.t29 (cl (= (* (- 1) tptp.a) (* (- 1) 3))) :rule resolution :premises (t496.t22 t496.t28))
% 0.47/0.66  (step t496.t30 (cl (=> (and (> 1 0) (< tptp.a 0)) (< (* 1 tptp.a) (* 1 0)))) :rule la_mult_pos)
% 0.47/0.66  (step t496.t31 (cl (not (and (> 1 0) (< tptp.a 0))) (< (* 1 tptp.a) (* 1 0))) :rule implies :premises (t496.t30))
% 0.47/0.66  (step t496.t32 (cl (and (> 1 0) (< tptp.a 0)) (not (> 1 0)) (not (< tptp.a 0))) :rule and_neg)
% 0.47/0.66  (step t496.t33 (cl (= (= (> 1 0) true) (> 1 0))) :rule equiv_simplify)
% 0.47/0.66  (step t496.t34 (cl (not (= (> 1 0) true)) (> 1 0)) :rule equiv1 :premises (t496.t33))
% 0.47/0.66  (step t496.t35 (cl (= (> 1 0) true)) :rule hole :args ((> 1 0)))
% 0.47/0.66  (step t496.t36 (cl (> 1 0)) :rule resolution :premises (t496.t34 t496.t35))
% 0.47/0.66  (step t496.t37 (cl (not (= (not (>= tptp.a 0)) (< tptp.a 0))) (not (not (>= tptp.a 0))) (< tptp.a 0)) :rule equiv_pos2)
% 0.47/0.66  (step t496.t38 (cl (= (< tptp.a 0) (not (>= tptp.a 0)))) :rule all_simplify)
% 0.47/0.66  (step t496.t39 (cl (= (not (>= tptp.a 0)) (< tptp.a 0))) :rule symm :premises (t496.t38))
% 0.47/0.66  (step t496.t40 (cl (< tptp.a 0)) :rule resolution :premises (t496.t37 t496.t39 t496.a0))
% 0.47/0.66  (step t496.t41 (cl (and (> 1 0) (< tptp.a 0))) :rule resolution :premises (t496.t32 t496.t36 t496.t40))
% 0.47/0.66  (step t496.t42 (cl (< (* 1 tptp.a) (* 1 0))) :rule resolution :premises (t496.t31 t496.t41))
% 0.47/0.66  (step t496.t43 (cl (< (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 3) (* 1 0)))) :rule resolution :premises (t496.t20 t496.t29 t496.t42))
% 0.47/0.66  (step t496.t44 (cl false) :rule resolution :premises (t496.t1 t496.t19 t496.t43))
% 0.47/0.66  (step t496 (cl (not (not (>= tptp.a 0))) (not (= tptp.a 3)) false) :rule subproof :discharge (t496.a0 t496.a1))
% 0.47/0.66  (step t497 (cl (not (and (not (>= tptp.a 0)) (= tptp.a 3))) (not (>= tptp.a 0))) :rule and_pos)
% 0.47/0.66  (step t498 (cl (not (and (not (>= tptp.a 0)) (= tptp.a 3))) (= tptp.a 3)) :rule and_pos)
% 0.47/0.66  (step t499 (cl false (not (and (not (>= tptp.a 0)) (= tptp.a 3))) (not (and (not (>= tptp.a 0)) (= tptp.a 3)))) :rule resolution :premises (t496 t497 t498))
% 0.47/0.66  (step t500 (cl (not (and (not (>= tptp.a 0)) (= tptp.a 3))) (not (and (not (>= tptp.a 0)) (= tptp.a 3))) false) :rule reordering :premises (t499))
% 0.47/0.66  (step t501 (cl (not (and (not (>= tptp.a 0)) (= tptp.a 3))) false) :rule contraction :premises (t500))
% 0.47/0.66  (step t502 (cl (=> (and (not (>= tptp.a 0)) (= tptp.a 3)) false) false) :rule resolution :premises (t495 t501))
% 0.47/0.66  (step t503 (cl (=> (and (not (>= tptp.a 0)) (= tptp.a 3)) false) (not false)) :rule implies_neg2)
% 0.47/0.66  (step t504 (cl (=> (and (not (>= tptp.a 0)) (= tptp.a 3)) false) (=> (and (not (>= tptp.a 0)) (= tptp.a 3)) false)) :rule resolution :premises (t502 t503))
% 0.47/0.66  (step t505 (cl (=> (and (not (>= tptp.a 0)) (= tptp.a 3)) false)) :rule contraction :premises (t504))
% 0.47/0.66  (step t506 (cl (= (=> (and (not (>= tptp.a 0)) (= tptp.a 3)) false) (not (and (not (>= tptp.a 0)) (= tptp.a 3))))) :rule implies_simplify)
% 0.47/0.66  (step t507 (cl (not (=> (and (not (>= tptp.a 0)) (= tptp.a 3)) false)) (not (and (not (>= tptp.a 0)) (= tptp.a 3)))) :rule equiv1 :premises (t506))
% 0.47/0.66  (step t508 (cl (not (and (not (>= tptp.a 0)) (= tptp.a 3)))) :rule resolution :premises (t505 t507))
% 0.47/0.66  (step t509 (cl (not (not (>= tptp.a 0))) (not (= tptp.a 3))) :rule not_and :premises (t508))
% 0.47/0.66  (step t510 (cl (or (not (not (>= tptp.a 0))) (not (= tptp.a 3))) (not (not (not (>= tptp.a 0))))) :rule or_neg)
% 0.47/0.66  (step t511 (cl (or (not (not (>= tptp.a 0))) (not (= tptp.a 3))) (not (not (= tptp.a 3)))) :rule or_neg)
% 0.47/0.66  (step t512 (cl (or (not (not (>= tptp.a 0))) (not (= tptp.a 3))) (or (not (not (>= tptp.a 0))) (not (= tptp.a 3)))) :rule resolution :premises (t509 t510 t511))
% 0.47/0.66  (step t513 (cl (or (not (not (>= tptp.a 0))) (not (= tptp.a 3)))) :rule contraction :premises (t512))
% 0.47/0.66  (step t514 (cl (or (>= tptp.a 0) (not (= tptp.a 3)))) :rule resolution :premises (t492 t494 t513))
% 0.47/0.66  (step t515 (cl (>= tptp.a 0) (not (= tptp.a 3))) :rule or :premises (t514))
% 0.47/0.66  (step t516 (cl (not (= (or (not (not (>= tptp.a 0))) (not (= tptp.a 2))) (or (>= tptp.a 0) (not (= tptp.a 2))))) (not (or (not (not (>= tptp.a 0))) (not (= tptp.a 2)))) (or (>= tptp.a 0) (not (= tptp.a 2)))) :rule equiv_pos2)
% 0.47/0.66  (step t517 (cl (= (not (= tptp.a 2)) (not (= tptp.a 2)))) :rule refl)
% 0.47/0.66  (step t518 (cl (= (or (not (not (>= tptp.a 0))) (not (= tptp.a 2))) (or (>= tptp.a 0) (not (= tptp.a 2))))) :rule cong :premises (t372 t517))
% 0.47/0.66  (step t519 (cl (=> (and (not (>= tptp.a 0)) (= tptp.a 2)) false) (and (not (>= tptp.a 0)) (= tptp.a 2))) :rule implies_neg1)
% 0.47/0.66  (anchor :step t520)
% 0.47/0.66  (assume t520.a0 (not (>= tptp.a 0)))
% 0.47/0.66  (assume t520.a1 (= tptp.a 2))
% 0.47/0.66  (step t520.t1 (cl (not (= (< (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 2) (* 1 0))) false)) (not (< (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 2) (* 1 0)))) false) :rule equiv_pos2)
% 0.47/0.66  (step t520.t2 (cl (= (< (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 2) (* 1 0))) (not (>= (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 2) (* 1 0)))))) :rule all_simplify)
% 0.47/0.66  (step t520.t3 (cl (= (* (- 1) tptp.a) (* (- 1) tptp.a))) :rule refl)
% 0.47/0.66  (step t520.t4 (cl (= (* 1 tptp.a) tptp.a)) :rule all_simplify)
% 0.47/0.66  (step t520.t5 (cl (= (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) tptp.a) tptp.a))) :rule cong :premises (t520.t3 t520.t4))
% 0.47/0.66  (step t520.t6 (cl (= (+ (* (- 1) tptp.a) tptp.a) 0)) :rule all_simplify)
% 0.47/0.66  (step t520.t7 (cl (= (+ (* (- 1) tptp.a) (* 1 tptp.a)) 0)) :rule trans :premises (t520.t5 t520.t6))
% 0.47/0.66  (step t520.t8 (cl (= (* (- 1) 2) (- 2))) :rule all_simplify)
% 0.47/0.66  (step t520.t9 (cl (= (* 1 0) 0)) :rule all_simplify)
% 0.47/0.66  (step t520.t10 (cl (= (+ (* (- 1) 2) (* 1 0)) (+ (- 2) 0))) :rule cong :premises (t520.t8 t520.t9))
% 0.47/0.66  (step t520.t11 (cl (= (+ (- 2) 0) (- 2))) :rule all_simplify)
% 0.47/0.66  (step t520.t12 (cl (= (+ (* (- 1) 2) (* 1 0)) (- 2))) :rule trans :premises (t520.t10 t520.t11))
% 0.47/0.66  (step t520.t13 (cl (= (>= (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 2) (* 1 0))) (>= 0 (- 2)))) :rule cong :premises (t520.t7 t520.t12))
% 0.47/0.66  (step t520.t14 (cl (= (>= 0 (- 2)) true)) :rule all_simplify)
% 0.47/0.66  (step t520.t15 (cl (= (>= (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 2) (* 1 0))) true)) :rule trans :premises (t520.t13 t520.t14))
% 0.47/0.66  (step t520.t16 (cl (= (not (>= (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 2) (* 1 0)))) (not true))) :rule cong :premises (t520.t15))
% 0.47/0.66  (step t520.t17 (cl (= (not true) false)) :rule all_simplify)
% 0.47/0.66  (step t520.t18 (cl (= (not (>= (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 2) (* 1 0)))) false)) :rule trans :premises (t520.t16 t520.t17))
% 0.47/0.66  (step t520.t19 (cl (= (< (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 2) (* 1 0))) false)) :rule trans :premises (t520.t2 t520.t18))
% 0.47/0.66  (step t520.t20 (cl (not (= (* (- 1) tptp.a) (* (- 1) 2))) (not (< (* 1 tptp.a) (* 1 0))) (< (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 2) (* 1 0)))) :rule la_generic :args ((- 1) 1 1))
% 0.47/0.66  (step t520.t21 (cl (=> (and (< (- 1) 0) (= tptp.a 2)) (= (* (- 1) tptp.a) (* (- 1) 2)))) :rule la_mult_neg)
% 0.47/0.66  (step t520.t22 (cl (not (and (< (- 1) 0) (= tptp.a 2))) (= (* (- 1) tptp.a) (* (- 1) 2))) :rule implies :premises (t520.t21))
% 0.47/0.66  (step t520.t23 (cl (and (< (- 1) 0) (= tptp.a 2)) (not (< (- 1) 0)) (not (= tptp.a 2))) :rule and_neg)
% 0.47/0.66  (step t520.t24 (cl (= (= (< (- 1) 0) true) (< (- 1) 0))) :rule equiv_simplify)
% 0.47/0.66  (step t520.t25 (cl (not (= (< (- 1) 0) true)) (< (- 1) 0)) :rule equiv1 :premises (t520.t24))
% 0.47/0.66  (step t520.t26 (cl (= (< (- 1) 0) true)) :rule hole :args ((< (- 1) 0)))
% 0.47/0.66  (step t520.t27 (cl (< (- 1) 0)) :rule resolution :premises (t520.t25 t520.t26))
% 0.47/0.66  (step t520.t28 (cl (and (< (- 1) 0) (= tptp.a 2))) :rule resolution :premises (t520.t23 t520.t27 t520.a1))
% 0.47/0.66  (step t520.t29 (cl (= (* (- 1) tptp.a) (* (- 1) 2))) :rule resolution :premises (t520.t22 t520.t28))
% 0.47/0.66  (step t520.t30 (cl (=> (and (> 1 0) (< tptp.a 0)) (< (* 1 tptp.a) (* 1 0)))) :rule la_mult_pos)
% 0.47/0.66  (step t520.t31 (cl (not (and (> 1 0) (< tptp.a 0))) (< (* 1 tptp.a) (* 1 0))) :rule implies :premises (t520.t30))
% 0.47/0.66  (step t520.t32 (cl (and (> 1 0) (< tptp.a 0)) (not (> 1 0)) (not (< tptp.a 0))) :rule and_neg)
% 0.47/0.66  (step t520.t33 (cl (= (= (> 1 0) true) (> 1 0))) :rule equiv_simplify)
% 0.47/0.66  (step t520.t34 (cl (not (= (> 1 0) true)) (> 1 0)) :rule equiv1 :premises (t520.t33))
% 0.47/0.66  (step t520.t35 (cl (= (> 1 0) true)) :rule hole :args ((> 1 0)))
% 0.47/0.66  (step t520.t36 (cl (> 1 0)) :rule resolution :premises (t520.t34 t520.t35))
% 0.47/0.66  (step t520.t37 (cl (not (= (not (>= tptp.a 0)) (< tptp.a 0))) (not (not (>= tptp.a 0))) (< tptp.a 0)) :rule equiv_pos2)
% 0.47/0.66  (step t520.t38 (cl (= (< tptp.a 0) (not (>= tptp.a 0)))) :rule all_simplify)
% 0.47/0.66  (step t520.t39 (cl (= (not (>= tptp.a 0)) (< tptp.a 0))) :rule symm :premises (t520.t38))
% 0.47/0.66  (step t520.t40 (cl (< tptp.a 0)) :rule resolution :premises (t520.t37 t520.t39 t520.a0))
% 0.47/0.66  (step t520.t41 (cl (and (> 1 0) (< tptp.a 0))) :rule resolution :premises (t520.t32 t520.t36 t520.t40))
% 0.47/0.66  (step t520.t42 (cl (< (* 1 tptp.a) (* 1 0))) :rule resolution :premises (t520.t31 t520.t41))
% 0.47/0.66  (step t520.t43 (cl (< (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 2) (* 1 0)))) :rule resolution :premises (t520.t20 t520.t29 t520.t42))
% 0.47/0.66  (step t520.t44 (cl false) :rule resolution :premises (t520.t1 t520.t19 t520.t43))
% 0.47/0.66  (step t520 (cl (not (not (>= tptp.a 0))) (not (= tptp.a 2)) false) :rule subproof :discharge (t520.a0 t520.a1))
% 0.47/0.66  (step t521 (cl (not (and (not (>= tptp.a 0)) (= tptp.a 2))) (not (>= tptp.a 0))) :rule and_pos)
% 0.47/0.66  (step t522 (cl (not (and (not (>= tptp.a 0)) (= tptp.a 2))) (= tptp.a 2)) :rule and_pos)
% 0.47/0.66  (step t523 (cl false (not (and (not (>= tptp.a 0)) (= tptp.a 2))) (not (and (not (>= tptp.a 0)) (= tptp.a 2)))) :rule resolution :premises (t520 t521 t522))
% 0.47/0.66  (step t524 (cl (not (and (not (>= tptp.a 0)) (= tptp.a 2))) (not (and (not (>= tptp.a 0)) (= tptp.a 2))) false) :rule reordering :premises (t523))
% 0.47/0.66  (step t525 (cl (not (and (not (>= tptp.a 0)) (= tptp.a 2))) false) :rule contraction :premises (t524))
% 0.47/0.66  (step t526 (cl (=> (and (not (>= tptp.a 0)) (= tptp.a 2)) false) false) :rule resolution :premises (t519 t525))
% 0.47/0.66  (step t527 (cl (=> (and (not (>= tptp.a 0)) (= tptp.a 2)) false) (not false)) :rule implies_neg2)
% 0.47/0.66  (step t528 (cl (=> (and (not (>= tptp.a 0)) (= tptp.a 2)) false) (=> (and (not (>= tptp.a 0)) (= tptp.a 2)) false)) :rule resolution :premises (t526 t527))
% 0.47/0.66  (step t529 (cl (=> (and (not (>= tptp.a 0)) (= tptp.a 2)) false)) :rule contraction :premises (t528))
% 0.47/0.66  (step t530 (cl (= (=> (and (not (>= tptp.a 0)) (= tptp.a 2)) false) (not (and (not (>= tptp.a 0)) (= tptp.a 2))))) :rule implies_simplify)
% 0.47/0.66  (step t531 (cl (not (=> (and (not (>= tptp.a 0)) (= tptp.a 2)) false)) (not (and (not (>= tptp.a 0)) (= tptp.a 2)))) :rule equiv1 :premises (t530))
% 0.47/0.66  (step t532 (cl (not (and (not (>= tptp.a 0)) (= tptp.a 2)))) :rule resolution :premises (t529 t531))
% 0.47/0.66  (step t533 (cl (not (not (>= tptp.a 0))) (not (= tptp.a 2))) :rule not_and :premises (t532))
% 0.47/0.66  (step t534 (cl (or (not (not (>= tptp.a 0))) (not (= tptp.a 2))) (not (not (not (>= tptp.a 0))))) :rule or_neg)
% 0.47/0.66  (step t535 (cl (or (not (not (>= tptp.a 0))) (not (= tptp.a 2))) (not (not (= tptp.a 2)))) :rule or_neg)
% 0.47/0.66  (step t536 (cl (or (not (not (>= tptp.a 0))) (not (= tptp.a 2))) (or (not (not (>= tptp.a 0))) (not (= tptp.a 2)))) :rule resolution :premises (t533 t534 t535))
% 0.47/0.66  (step t537 (cl (or (not (not (>= tptp.a 0))) (not (= tptp.a 2)))) :rule contraction :premises (t536))
% 0.47/0.66  (step t538 (cl (or (>= tptp.a 0) (not (= tptp.a 2)))) :rule resolution :premises (t516 t518 t537))
% 0.47/0.66  (step t539 (cl (>= tptp.a 0) (not (= tptp.a 2))) :rule or :premises (t538))
% 0.47/0.66  (step t540 (cl (not (= (or (not (not (>= tptp.a 0))) (not (= tptp.a 1))) (or (>= tptp.a 0) (not (= tptp.a 1))))) (not (or (not (not (>= tptp.a 0))) (not (= tptp.a 1)))) (or (>= tptp.a 0) (not (= tptp.a 1)))) :rule equiv_pos2)
% 0.47/0.66  (step t541 (cl (= (not (= tptp.a 1)) (not (= tptp.a 1)))) :rule refl)
% 0.47/0.66  (step t542 (cl (= (or (not (not (>= tptp.a 0))) (not (= tptp.a 1))) (or (>= tptp.a 0) (not (= tptp.a 1))))) :rule cong :premises (t372 t541))
% 0.47/0.66  (step t543 (cl (=> (and (not (>= tptp.a 0)) (= tptp.a 1)) false) (and (not (>= tptp.a 0)) (= tptp.a 1))) :rule implies_neg1)
% 0.47/0.66  (anchor :step t544)
% 0.47/0.66  (assume t544.a0 (not (>= tptp.a 0)))
% 0.47/0.66  (assume t544.a1 (= tptp.a 1))
% 0.47/0.66  (step t544.t1 (cl (not (= (< (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 1) (* 1 0))) false)) (not (< (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 1) (* 1 0)))) false) :rule equiv_pos2)
% 0.47/0.66  (step t544.t2 (cl (= (< (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 1) (* 1 0))) (not (>= (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 1) (* 1 0)))))) :rule all_simplify)
% 0.47/0.66  (step t544.t3 (cl (= (* (- 1) tptp.a) (* (- 1) tptp.a))) :rule refl)
% 0.47/0.66  (step t544.t4 (cl (= (* 1 tptp.a) tptp.a)) :rule all_simplify)
% 0.47/0.66  (step t544.t5 (cl (= (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) tptp.a) tptp.a))) :rule cong :premises (t544.t3 t544.t4))
% 0.47/0.66  (step t544.t6 (cl (= (+ (* (- 1) tptp.a) tptp.a) 0)) :rule all_simplify)
% 0.47/0.66  (step t544.t7 (cl (= (+ (* (- 1) tptp.a) (* 1 tptp.a)) 0)) :rule trans :premises (t544.t5 t544.t6))
% 0.47/0.66  (step t544.t8 (cl (= (* (- 1) 1) (- 1))) :rule all_simplify)
% 0.47/0.66  (step t544.t9 (cl (= (* 1 0) 0)) :rule all_simplify)
% 0.47/0.66  (step t544.t10 (cl (= (+ (* (- 1) 1) (* 1 0)) (+ (- 1) 0))) :rule cong :premises (t544.t8 t544.t9))
% 0.47/0.66  (step t544.t11 (cl (= (+ (- 1) 0) (- 1))) :rule all_simplify)
% 0.47/0.66  (step t544.t12 (cl (= (+ (* (- 1) 1) (* 1 0)) (- 1))) :rule trans :premises (t544.t10 t544.t11))
% 0.47/0.66  (step t544.t13 (cl (= (>= (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 1) (* 1 0))) (>= 0 (- 1)))) :rule cong :premises (t544.t7 t544.t12))
% 0.47/0.66  (step t544.t14 (cl (= (>= 0 (- 1)) true)) :rule all_simplify)
% 0.47/0.66  (step t544.t15 (cl (= (>= (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 1) (* 1 0))) true)) :rule trans :premises (t544.t13 t544.t14))
% 0.47/0.66  (step t544.t16 (cl (= (not (>= (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 1) (* 1 0)))) (not true))) :rule cong :premises (t544.t15))
% 0.47/0.66  (step t544.t17 (cl (= (not true) false)) :rule all_simplify)
% 0.47/0.66  (step t544.t18 (cl (= (not (>= (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 1) (* 1 0)))) false)) :rule trans :premises (t544.t16 t544.t17))
% 0.47/0.66  (step t544.t19 (cl (= (< (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 1) (* 1 0))) false)) :rule trans :premises (t544.t2 t544.t18))
% 0.47/0.66  (step t544.t20 (cl (not (= (* (- 1) tptp.a) (* (- 1) 1))) (not (< (* 1 tptp.a) (* 1 0))) (< (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 1) (* 1 0)))) :rule la_generic :args ((- 1) 1 1))
% 0.47/0.66  (step t544.t21 (cl (=> (and (< (- 1) 0) (= tptp.a 1)) (= (* (- 1) tptp.a) (* (- 1) 1)))) :rule la_mult_neg)
% 0.47/0.66  (step t544.t22 (cl (not (and (< (- 1) 0) (= tptp.a 1))) (= (* (- 1) tptp.a) (* (- 1) 1))) :rule implies :premises (t544.t21))
% 0.47/0.66  (step t544.t23 (cl (and (< (- 1) 0) (= tptp.a 1)) (not (< (- 1) 0)) (not (= tptp.a 1))) :rule and_neg)
% 0.47/0.66  (step t544.t24 (cl (= (= (< (- 1) 0) true) (< (- 1) 0))) :rule equiv_simplify)
% 0.47/0.66  (step t544.t25 (cl (not (= (< (- 1) 0) true)) (< (- 1) 0)) :rule equiv1 :premises (t544.t24))
% 0.47/0.66  (step t544.t26 (cl (= (< (- 1) 0) true)) :rule hole :args ((< (- 1) 0)))
% 0.47/0.66  (step t544.t27 (cl (< (- 1) 0)) :rule resolution :premises (t544.t25 t544.t26))
% 0.47/0.66  (step t544.t28 (cl (and (< (- 1) 0) (= tptp.a 1))) :rule resolution :premises (t544.t23 t544.t27 t544.a1))
% 0.47/0.66  (step t544.t29 (cl (= (* (- 1) tptp.a) (* (- 1) 1))) :rule resolution :premises (t544.t22 t544.t28))
% 0.47/0.66  (step t544.t30 (cl (=> (and (> 1 0) (< tptp.a 0)) (< (* 1 tptp.a) (* 1 0)))) :rule la_mult_pos)
% 0.47/0.66  (step t544.t31 (cl (not (and (> 1 0) (< tptp.a 0))) (< (* 1 tptp.a) (* 1 0))) :rule implies :premises (t544.t30))
% 0.47/0.66  (step t544.t32 (cl (and (> 1 0) (< tptp.a 0)) (not (> 1 0)) (not (< tptp.a 0))) :rule and_neg)
% 0.47/0.66  (step t544.t33 (cl (= (= (> 1 0) true) (> 1 0))) :rule equiv_simplify)
% 0.47/0.66  (step t544.t34 (cl (not (= (> 1 0) true)) (> 1 0)) :rule equiv1 :premises (t544.t33))
% 0.47/0.66  (step t544.t35 (cl (= (> 1 0) true)) :rule hole :args ((> 1 0)))
% 0.47/0.66  (step t544.t36 (cl (> 1 0)) :rule resolution :premises (t544.t34 t544.t35))
% 0.47/0.66  (step t544.t37 (cl (not (= (not (>= tptp.a 0)) (< tptp.a 0))) (not (not (>= tptp.a 0))) (< tptp.a 0)) :rule equiv_pos2)
% 0.47/0.66  (step t544.t38 (cl (= (< tptp.a 0) (not (>= tptp.a 0)))) :rule all_simplify)
% 0.47/0.66  (step t544.t39 (cl (= (not (>= tptp.a 0)) (< tptp.a 0))) :rule symm :premises (t544.t38))
% 0.47/0.66  (step t544.t40 (cl (< tptp.a 0)) :rule resolution :premises (t544.t37 t544.t39 t544.a0))
% 0.47/0.66  (step t544.t41 (cl (and (> 1 0) (< tptp.a 0))) :rule resolution :premises (t544.t32 t544.t36 t544.t40))
% 0.47/0.66  (step t544.t42 (cl (< (* 1 tptp.a) (* 1 0))) :rule resolution :premises (t544.t31 t544.t41))
% 0.47/0.66  (step t544.t43 (cl (< (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 1) (* 1 0)))) :rule resolution :premises (t544.t20 t544.t29 t544.t42))
% 0.47/0.66  (step t544.t44 (cl false) :rule resolution :premises (t544.t1 t544.t19 t544.t43))
% 0.47/0.66  (step t544 (cl (not (not (>= tptp.a 0))) (not (= tptp.a 1)) false) :rule subproof :discharge (t544.a0 t544.a1))
% 0.47/0.66  (step t545 (cl (not (and (not (>= tptp.a 0)) (= tptp.a 1))) (not (>= tptp.a 0))) :rule and_pos)
% 0.47/0.66  (step t546 (cl (not (and (not (>= tptp.a 0)) (= tptp.a 1))) (= tptp.a 1)) :rule and_pos)
% 0.47/0.66  (step t547 (cl false (not (and (not (>= tptp.a 0)) (= tptp.a 1))) (not (and (not (>= tptp.a 0)) (= tptp.a 1)))) :rule resolution :premises (t544 t545 t546))
% 0.47/0.66  (step t548 (cl (not (and (not (>= tptp.a 0)) (= tptp.a 1))) (not (and (not (>= tptp.a 0)) (= tptp.a 1))) false) :rule reordering :premises (t547))
% 0.47/0.66  (step t549 (cl (not (and (not (>= tptp.a 0)) (= tptp.a 1))) false) :rule contraction :premises (t548))
% 0.47/0.66  (step t550 (cl (=> (and (not (>= tptp.a 0)) (= tptp.a 1)) false) false) :rule resolution :premises (t543 t549))
% 0.47/0.66  (step t551 (cl (=> (and (not (>= tptp.a 0)) (= tptp.a 1)) false) (not false)) :rule implies_neg2)
% 0.47/0.66  (step t552 (cl (=> (and (not (>= tptp.a 0)) (= tptp.a 1)) false) (=> (and (not (>= tptp.a 0)) (= tptp.a 1)) false)) :rule resolution :premises (t550 t551))
% 0.47/0.66  (step t553 (cl (=> (and (not (>= tptp.a 0)) (= tptp.a 1)) false)) :rule contraction :premises (t552))
% 0.47/0.66  (step t554 (cl (= (=> (and (not (>= tptp.a 0)) (= tptp.a 1)) false) (not (and (not (>= tptp.a 0)) (= tptp.a 1))))) :rule implies_simplify)
% 0.47/0.66  (step t555 (cl (not (=> (and (not (>= tptp.a 0)) (= tptp.a 1)) false)) (not (and (not (>= tptp.a 0)) (= tptp.a 1)))) :rule equiv1 :premises (t554))
% 0.47/0.66  (step t556 (cl (not (and (not (>= tptp.a 0)) (= tptp.a 1)))) :rule resolution :premises (t553 t555))
% 0.47/0.66  (step t557 (cl (not (not (>= tptp.a 0))) (not (= tptp.a 1))) :rule not_and :premises (t556))
% 0.47/0.66  (step t558 (cl (or (not (not (>= tptp.a 0))) (not (= tptp.a 1))) (not (not (not (>= tptp.a 0))))) :rule or_neg)
% 0.47/0.66  (step t559 (cl (or (not (not (>= tptp.a 0))) (not (= tptp.a 1))) (not (not (= tptp.a 1)))) :rule or_neg)
% 0.47/0.66  (step t560 (cl (or (not (not (>= tptp.a 0))) (not (= tptp.a 1))) (or (not (not (>= tptp.a 0))) (not (= tptp.a 1)))) :rule resolution :premises (t557 t558 t559))
% 0.47/0.66  (step t561 (cl (or (not (not (>= tptp.a 0))) (not (= tptp.a 1)))) :rule contraction :premises (t560))
% 0.47/0.66  (step t562 (cl (or (>= tptp.a 0) (not (= tptp.a 1)))) :rule resolution :premises (t540 t542 t561))
% 0.47/0.66  (step t563 (cl (>= tptp.a 0) (not (= tptp.a 1))) :rule or :premises (t562))
% 0.47/0.66  (step t564 (cl (not (= (or (not (not (>= tptp.a 0))) (not (= tptp.a 0))) (or (>= tptp.a 0) (not (= tptp.a 0))))) (not (or (not (not (>= tptp.a 0))) (not (= tptp.a 0)))) (or (>= tptp.a 0) (not (= tptp.a 0)))) :rule equiv_pos2)
% 0.47/0.66  (step t565 (cl (= (not (= tptp.a 0)) (not (= tptp.a 0)))) :rule refl)
% 0.47/0.66  (step t566 (cl (= (or (not (not (>= tptp.a 0))) (not (= tptp.a 0))) (or (>= tptp.a 0) (not (= tptp.a 0))))) :rule cong :premises (t372 t565))
% 0.47/0.66  (step t567 (cl (=> (and (not (>= tptp.a 0)) (= tptp.a 0)) false) (and (not (>= tptp.a 0)) (= tptp.a 0))) :rule implies_neg1)
% 0.47/0.66  (anchor :step t568)
% 0.47/0.66  (assume t568.a0 (not (>= tptp.a 0)))
% 0.47/0.66  (assume t568.a1 (= tptp.a 0))
% 0.47/0.66  (step t568.t1 (cl (not (= (< (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 0) (* 1 0))) false)) (not (< (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 0) (* 1 0)))) false) :rule equiv_pos2)
% 0.47/0.66  (step t568.t2 (cl (= (< (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 0) (* 1 0))) (not (>= (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 0) (* 1 0)))))) :rule all_simplify)
% 0.47/0.66  (step t568.t3 (cl (= (* (- 1) tptp.a) (* (- 1) tptp.a))) :rule refl)
% 0.47/0.66  (step t568.t4 (cl (= (* 1 tptp.a) tptp.a)) :rule all_simplify)
% 0.47/0.66  (step t568.t5 (cl (= (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) tptp.a) tptp.a))) :rule cong :premises (t568.t3 t568.t4))
% 0.47/0.66  (step t568.t6 (cl (= (+ (* (- 1) tptp.a) tptp.a) 0)) :rule all_simplify)
% 0.47/0.66  (step t568.t7 (cl (= (+ (* (- 1) tptp.a) (* 1 tptp.a)) 0)) :rule trans :premises (t568.t5 t568.t6))
% 0.47/0.66  (step t568.t8 (cl (= (* (- 1) 0) 0)) :rule all_simplify)
% 0.47/0.66  (step t568.t9 (cl (= (* 1 0) 0)) :rule all_simplify)
% 0.47/0.66  (step t568.t10 (cl (= (+ (* (- 1) 0) (* 1 0)) (+ 0 0))) :rule cong :premises (t568.t8 t568.t9))
% 0.47/0.66  (step t568.t11 (cl (= (+ 0 0) 0)) :rule all_simplify)
% 0.47/0.66  (step t568.t12 (cl (= (+ (* (- 1) 0) (* 1 0)) 0)) :rule trans :premises (t568.t10 t568.t11))
% 0.47/0.66  (step t568.t13 (cl (= (>= (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 0) (* 1 0))) (>= 0 0))) :rule cong :premises (t568.t7 t568.t12))
% 0.47/0.66  (step t568.t14 (cl (= (>= 0 0) true)) :rule all_simplify)
% 0.47/0.66  (step t568.t15 (cl (= (>= (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 0) (* 1 0))) true)) :rule trans :premises (t568.t13 t568.t14))
% 0.47/0.66  (step t568.t16 (cl (= (not (>= (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 0) (* 1 0)))) (not true))) :rule cong :premises (t568.t15))
% 0.47/0.66  (step t568.t17 (cl (= (not true) false)) :rule all_simplify)
% 0.47/0.66  (step t568.t18 (cl (= (not (>= (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 0) (* 1 0)))) false)) :rule trans :premises (t568.t16 t568.t17))
% 0.47/0.66  (step t568.t19 (cl (= (< (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 0) (* 1 0))) false)) :rule trans :premises (t568.t2 t568.t18))
% 0.47/0.66  (step t568.t20 (cl (not (= (* (- 1) tptp.a) (* (- 1) 0))) (not (< (* 1 tptp.a) (* 1 0))) (< (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 0) (* 1 0)))) :rule la_generic :args ((- 1) 1 1))
% 0.47/0.66  (step t568.t21 (cl (=> (and (< (- 1) 0) (= tptp.a 0)) (= (* (- 1) tptp.a) (* (- 1) 0)))) :rule la_mult_neg)
% 0.47/0.66  (step t568.t22 (cl (not (and (< (- 1) 0) (= tptp.a 0))) (= (* (- 1) tptp.a) (* (- 1) 0))) :rule implies :premises (t568.t21))
% 0.47/0.66  (step t568.t23 (cl (and (< (- 1) 0) (= tptp.a 0)) (not (< (- 1) 0)) (not (= tptp.a 0))) :rule and_neg)
% 0.47/0.66  (step t568.t24 (cl (= (= (< (- 1) 0) true) (< (- 1) 0))) :rule equiv_simplify)
% 0.47/0.66  (step t568.t25 (cl (not (= (< (- 1) 0) true)) (< (- 1) 0)) :rule equiv1 :premises (t568.t24))
% 0.47/0.66  (step t568.t26 (cl (= (< (- 1) 0) true)) :rule hole :args ((< (- 1) 0)))
% 0.47/0.66  (step t568.t27 (cl (< (- 1) 0)) :rule resolution :premises (t568.t25 t568.t26))
% 0.47/0.66  (step t568.t28 (cl (and (< (- 1) 0) (= tptp.a 0))) :rule resolution :premises (t568.t23 t568.t27 t568.a1))
% 0.47/0.66  (step t568.t29 (cl (= (* (- 1) tptp.a) (* (- 1) 0))) :rule resolution :premises (t568.t22 t568.t28))
% 0.47/0.66  (step t568.t30 (cl (=> (and (> 1 0) (< tptp.a 0)) (< (* 1 tptp.a) (* 1 0)))) :rule la_mult_pos)
% 0.47/0.66  (step t568.t31 (cl (not (and (> 1 0) (< tptp.a 0))) (< (* 1 tptp.a) (* 1 0))) :rule implies :premises (t568.t30))
% 0.47/0.66  (step t568.t32 (cl (and (> 1 0) (< tptp.a 0)) (not (> 1 0)) (not (< tptp.a 0))) :rule and_neg)
% 0.47/0.66  (step t568.t33 (cl (= (= (> 1 0) true) (> 1 0))) :rule equiv_simplify)
% 0.47/0.66  (step t568.t34 (cl (not (= (> 1 0) true)) (> 1 0)) :rule equiv1 :premises (t568.t33))
% 0.47/0.66  (step t568.t35 (cl (= (> 1 0) true)) :rule hole :args ((> 1 0)))
% 0.47/0.66  (step t568.t36 (cl (> 1 0)) :rule resolution :premises (t568.t34 t568.t35))
% 0.47/0.66  (step t568.t37 (cl (not (= (not (>= tptp.a 0)) (< tptp.a 0))) (not (not (>= tptp.a 0))) (< tptp.a 0)) :rule equiv_pos2)
% 0.47/0.66  (step t568.t38 (cl (= (< tptp.a 0) (not (>= tptp.a 0)))) :rule all_simplify)
% 0.47/0.66  (step t568.t39 (cl (= (not (>= tptp.a 0)) (< tptp.a 0))) :rule symm :premises (t568.t38))
% 0.47/0.66  (step t568.t40 (cl (< tptp.a 0)) :rule resolution :premises (t568.t37 t568.t39 t568.a0))
% 0.47/0.66  (step t568.t41 (cl (and (> 1 0) (< tptp.a 0))) :rule resolution :premises (t568.t32 t568.t36 t568.t40))
% 0.47/0.66  (step t568.t42 (cl (< (* 1 tptp.a) (* 1 0))) :rule resolution :premises (t568.t31 t568.t41))
% 0.47/0.66  (step t568.t43 (cl (< (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 0) (* 1 0)))) :rule resolution :premises (t568.t20 t568.t29 t568.t42))
% 0.47/0.66  (step t568.t44 (cl false) :rule resolution :premises (t568.t1 t568.t19 t568.t43))
% 0.47/0.66  (step t568 (cl (not (not (>= tptp.a 0))) (not (= tptp.a 0)) false) :rule subproof :discharge (t568.a0 t568.a1))
% 0.47/0.66  (step t569 (cl (not (and (not (>= tptp.a 0)) (= tptp.a 0))) (not (>= tptp.a 0))) :rule and_pos)
% 0.47/0.66  (step t570 (cl (not (and (not (>= tptp.a 0)) (= tptp.a 0))) (= tptp.a 0)) :rule and_pos)
% 0.47/0.66  (step t571 (cl false (not (and (not (>= tptp.a 0)) (= tptp.a 0))) (not (and (not (>= tptp.a 0)) (= tptp.a 0)))) :rule resolution :premises (t568 t569 t570))
% 0.47/0.66  (step t572 (cl (not (and (not (>= tptp.a 0)) (= tptp.a 0))) (not (and (not (>= tptp.a 0)) (= tptp.a 0))) false) :rule reordering :premises (t571))
% 0.47/0.66  (step t573 (cl (not (and (not (>= tptp.a 0)) (= tptp.a 0))) false) :rule contraction :premises (t572))
% 0.47/0.66  (step t574 (cl (=> (and (not (>= tptp.a 0)) (= tptp.a 0)) false) false) :rule resolution :premises (t567 t573))
% 0.47/0.66  (step t575 (cl (=> (and (not (>= tptp.a 0)) (= tptp.a 0)) false) (not false)) :rule implies_neg2)
% 0.47/0.66  (step t576 (cl (=> (and (not (>= tptp.a 0)) (= tptp.a 0)) false) (=> (and (not (>= tptp.a 0)) (= tptp.a 0)) false)) :rule resolution :premises (t574 t575))
% 0.47/0.66  (step t577 (cl (=> (and (not (>= tptp.a 0)) (= tptp.a 0)) false)) :rule contraction :premises (t576))
% 0.47/0.66  (step t578 (cl (= (=> (and (not (>= tptp.a 0)) (= tptp.a 0)) false) (not (and (not (>= tptp.a 0)) (= tptp.a 0))))) :rule implies_simplify)
% 0.47/0.66  (step t579 (cl (not (=> (and (not (>= tptp.a 0)) (= tptp.a 0)) false)) (not (and (not (>= tptp.a 0)) (= tptp.a 0)))) :rule equiv1 :premises (t578))
% 0.47/0.66  (step t580 (cl (not (and (not (>= tptp.a 0)) (= tptp.a 0)))) :rule resolution :premises (t577 t579))
% 0.47/0.66  (step t581 (cl (not (not (>= tptp.a 0))) (not (= tptp.a 0))) :rule not_and :premises (t580))
% 0.47/0.66  (step t582 (cl (or (not (not (>= tptp.a 0))) (not (= tptp.a 0))) (not (not (not (>= tptp.a 0))))) :rule or_neg)
% 0.47/0.66  (step t583 (cl (or (not (not (>= tptp.a 0))) (not (= tptp.a 0))) (not (not (= tptp.a 0)))) :rule or_neg)
% 0.47/0.66  (step t584 (cl (or (not (not (>= tptp.a 0))) (not (= tptp.a 0))) (or (not (not (>= tptp.a 0))) (not (= tptp.a 0)))) :rule resolution :premises (t581 t582 t583))
% 0.47/0.66  (step t585 (cl (or (not (not (>= tptp.a 0))) (not (= tptp.a 0)))) :rule contraction :premises (t584))
% 0.47/0.66  (step t586 (cl (or (>= tptp.a 0) (not (= tptp.a 0)))) :rule resolution :premises (t564 t566 t585))
% 0.47/0.66  (step t587 (cl (>= tptp.a 0) (not (= tptp.a 0))) :rule or :premises (t586))
% 0.47/0.66  (step t588 (cl (= tptp.a 9) (not (or (= tptp.a 9) (= tptp.a 8) (= tptp.a 7) (= tptp.a 6) (= tptp.a 5) (= tptp.a 4) (= tptp.a 3) (= tptp.a 2) (= tptp.a 1) (= tptp.a 0))) (>= tptp.a 0) (>= tptp.a 0) (>= tptp.a 0) (>= tptp.a 0) (>= tptp.a 0) (>= tptp.a 0) (>= tptp.a 0) (>= tptp.a 0) (>= tptp.a 0)) :rule resolution :premises (t233 t395 t419 t443 t467 t491 t515 t539 t563 t587))
% 0.47/0.66  (step t589 (cl (= tptp.a 9) (not (or (= tptp.a 9) (= tptp.a 8) (= tptp.a 7) (= tptp.a 6) (= tptp.a 5) (= tptp.a 4) (= tptp.a 3) (= tptp.a 2) (= tptp.a 1) (= tptp.a 0))) (>= tptp.a 0)) :rule contraction :premises (t588))
% 0.47/0.66  (step t590 (cl (= tptp.a 9) (>= tptp.a 0) (not (or (= tptp.a 9) (= tptp.a 8) (= tptp.a 7) (= tptp.a 6) (= tptp.a 5) (= tptp.a 4) (= tptp.a 3) (= tptp.a 2) (= tptp.a 1) (= tptp.a 0)))) :rule reordering :premises (t589))
% 0.47/0.66  (step t591 (cl (= tptp.a 9) (not (or (= tptp.a 9) (= tptp.a 8) (= tptp.a 7) (= tptp.a 6) (= tptp.a 5) (= tptp.a 4) (= tptp.a 3) (= tptp.a 2) (= tptp.a 1) (= tptp.a 0))) (and (not (>= tptp.a 10)) (>= tptp.a 0)) (= tptp.a 9) (not (or (= tptp.a 9) (= tptp.a 8) (= tptp.a 7) (= tptp.a 6) (= tptp.a 5) (= tptp.a 4) (= tptp.a 3) (= tptp.a 2) (= tptp.a 1) (= tptp.a 0)))) :rule resolution :premises (t370 t23 t590))
% 0.47/0.66  (step t592 (cl (= tptp.a 9) (not (or (= tptp.a 9) (= tptp.a 8) (= tptp.a 7) (= tptp.a 6) (= tptp.a 5) (= tptp.a 4) (= tptp.a 3) (= tptp.a 2) (= tptp.a 1) (= tptp.a 0))) (and (not (>= tptp.a 10)) (>= tptp.a 0))) :rule contraction :premises (t591))
% 0.47/0.66  (step t593 (cl (or (= tptp.a 9) (= tptp.a 8) (= tptp.a 7) (= tptp.a 6) (= tptp.a 5) (= tptp.a 4) (= tptp.a 3) (= tptp.a 2) (= tptp.a 1) (= tptp.a 0)) (and (not (>= tptp.a 10)) (>= tptp.a 0))) :rule not_equiv1 :premises (t36))
% 0.47/0.66  (step t594 (cl (= tptp.a 9) (and (not (>= tptp.a 10)) (>= tptp.a 0)) (and (not (>= tptp.a 10)) (>= tptp.a 0))) :rule resolution :premises (t592 t593))
% 0.47/0.66  (step t595 (cl (= tptp.a 9) (and (not (>= tptp.a 10)) (>= tptp.a 0))) :rule contraction :premises (t594))
% 0.47/0.66  (step t596 (cl (= tptp.a 9) (= tptp.a 9)) :rule resolution :premises (t231 t595))
% 0.47/0.66  (step t597 (cl (= tptp.a 9)) :rule contraction :premises (t596))
% 0.47/0.66  (step t598 (cl (or (= tptp.a 9) (= tptp.a 8) (= tptp.a 7) (= tptp.a 6) (= tptp.a 5) (= tptp.a 4) (= tptp.a 3) (= tptp.a 2) (= tptp.a 1) (= tptp.a 0))) :rule resolution :premises (t38 t597))
% 0.47/0.66  (step t599 (cl (not (and (not (>= tptp.a 10)) (>= tptp.a 0)))) :rule resolution :premises (t37 t598))
% 0.47/0.66  (step t600 (cl (not (= (or (not (not (>= tptp.a 0))) (not (= tptp.a 9))) (or (>= tptp.a 0) (not (= tptp.a 9))))) (not (or (not (not (>= tptp.a 0))) (not (= tptp.a 9)))) (or (>= tptp.a 0) (not (= tptp.a 9)))) :rule equiv_pos2)
% 0.47/0.66  (step t601 (cl (= (not (= tptp.a 9)) (not (= tptp.a 9)))) :rule refl)
% 0.47/0.66  (step t602 (cl (= (or (not (not (>= tptp.a 0))) (not (= tptp.a 9))) (or (>= tptp.a 0) (not (= tptp.a 9))))) :rule cong :premises (t372 t601))
% 0.47/0.66  (step t603 (cl (=> (and (not (>= tptp.a 0)) (= tptp.a 9)) false) (and (not (>= tptp.a 0)) (= tptp.a 9))) :rule implies_neg1)
% 0.47/0.66  (anchor :step t604)
% 0.47/0.66  (assume t604.a0 (not (>= tptp.a 0)))
% 0.47/0.66  (assume t604.a1 (= tptp.a 9))
% 0.47/0.66  (step t604.t1 (cl (not (= (< (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 9) (* 1 0))) false)) (not (< (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 9) (* 1 0)))) false) :rule equiv_pos2)
% 0.47/0.66  (step t604.t2 (cl (= (< (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 9) (* 1 0))) (not (>= (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 9) (* 1 0)))))) :rule all_simplify)
% 0.47/0.66  (step t604.t3 (cl (= (* (- 1) tptp.a) (* (- 1) tptp.a))) :rule refl)
% 0.47/0.66  (step t604.t4 (cl (= (* 1 tptp.a) tptp.a)) :rule all_simplify)
% 0.47/0.66  (step t604.t5 (cl (= (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) tptp.a) tptp.a))) :rule cong :premises (t604.t3 t604.t4))
% 0.47/0.66  (step t604.t6 (cl (= (+ (* (- 1) tptp.a) tptp.a) 0)) :rule all_simplify)
% 0.47/0.66  (step t604.t7 (cl (= (+ (* (- 1) tptp.a) (* 1 tptp.a)) 0)) :rule trans :premises (t604.t5 t604.t6))
% 0.47/0.66  (step t604.t8 (cl (= (* (- 1) 9) (- 9))) :rule all_simplify)
% 0.47/0.66  (step t604.t9 (cl (= (* 1 0) 0)) :rule all_simplify)
% 0.47/0.66  (step t604.t10 (cl (= (+ (* (- 1) 9) (* 1 0)) (+ (- 9) 0))) :rule cong :premises (t604.t8 t604.t9))
% 0.47/0.66  (step t604.t11 (cl (= (+ (- 9) 0) (- 9))) :rule all_simplify)
% 0.47/0.66  (step t604.t12 (cl (= (+ (* (- 1) 9) (* 1 0)) (- 9))) :rule trans :premises (t604.t10 t604.t11))
% 0.47/0.66  (step t604.t13 (cl (= (>= (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 9) (* 1 0))) (>= 0 (- 9)))) :rule cong :premises (t604.t7 t604.t12))
% 0.47/0.66  (step t604.t14 (cl (= (>= 0 (- 9)) true)) :rule all_simplify)
% 0.47/0.66  (step t604.t15 (cl (= (>= (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 9) (* 1 0))) true)) :rule trans :premises (t604.t13 t604.t14))
% 0.47/0.66  (step t604.t16 (cl (= (not (>= (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 9) (* 1 0)))) (not true))) :rule cong :premises (t604.t15))
% 0.47/0.66  (step t604.t17 (cl (= (not true) false)) :rule all_simplify)
% 0.47/0.66  (step t604.t18 (cl (= (not (>= (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 9) (* 1 0)))) false)) :rule trans :premises (t604.t16 t604.t17))
% 0.47/0.66  (step t604.t19 (cl (= (< (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 9) (* 1 0))) false)) :rule trans :premises (t604.t2 t604.t18))
% 0.47/0.66  (step t604.t20 (cl (not (= (* (- 1) tptp.a) (* (- 1) 9))) (not (< (* 1 tptp.a) (* 1 0))) (< (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 9) (* 1 0)))) :rule la_generic :args ((- 1) 1 1))
% 0.47/0.66  (step t604.t21 (cl (=> (and (< (- 1) 0) (= tptp.a 9)) (= (* (- 1) tptp.a) (* (- 1) 9)))) :rule la_mult_neg)
% 0.47/0.66  (step t604.t22 (cl (not (and (< (- 1) 0) (= tptp.a 9))) (= (* (- 1) tptp.a) (* (- 1) 9))) :rule implies :premises (t604.t21))
% 0.47/0.66  (step t604.t23 (cl (and (< (- 1) 0) (= tptp.a 9)) (not (< (- 1) 0)) (not (= tptp.a 9))) :rule and_neg)
% 0.47/0.66  (step t604.t24 (cl (= (= (< (- 1) 0) true) (< (- 1) 0))) :rule equiv_simplify)
% 0.47/0.66  (step t604.t25 (cl (not (= (< (- 1) 0) true)) (< (- 1) 0)) :rule equiv1 :premises (t604.t24))
% 0.47/0.66  (step t604.t26 (cl (= (< (- 1) 0) true)) :rule hole :args ((< (- 1) 0)))
% 0.47/0.66  (step t604.t27 (cl (< (- 1) 0)) :rule resolution :premises (t604.t25 t604.t26))
% 0.47/0.66  (step t604.t28 (cl (and (< (- 1) 0) (= tptp.a 9))) :rule resolution :premises (t604.t23 t604.t27 t604.a1))
% 0.47/0.66  (step t604.t29 (cl (= (* (- 1) tptp.a) (* (- 1) 9))) :rule resolution :premises (t604.t22 t604.t28))
% 0.47/0.66  (step t604.t30 (cl (=> (and (> 1 0) (< tptp.a 0)) (< (* 1 tptp.a) (* 1 0)))) :rule la_mult_pos)
% 0.47/0.66  (step t604.t31 (cl (not (and (> 1 0) (< tptp.a 0))) (< (* 1 tptp.a) (* 1 0))) :rule implies :premises (t604.t30))
% 0.47/0.66  (step t604.t32 (cl (and (> 1 0) (< tptp.a 0)) (not (> 1 0)) (not (< tptp.a 0))) :rule and_neg)
% 0.47/0.66  (step t604.t33 (cl (= (= (> 1 0) true) (> 1 0))) :rule equiv_simplify)
% 0.47/0.66  (step t604.t34 (cl (not (= (> 1 0) true)) (> 1 0)) :rule equiv1 :premises (t604.t33))
% 0.47/0.66  (step t604.t35 (cl (= (> 1 0) true)) :rule hole :args ((> 1 0)))
% 0.47/0.66  (step t604.t36 (cl (> 1 0)) :rule resolution :premises (t604.t34 t604.t35))
% 0.47/0.66  (step t604.t37 (cl (not (= (not (>= tptp.a 0)) (< tptp.a 0))) (not (not (>= tptp.a 0))) (< tptp.a 0)) :rule equiv_pos2)
% 0.47/0.66  (step t604.t38 (cl (= (< tptp.a 0) (not (>= tptp.a 0)))) :rule all_simplify)
% 0.47/0.66  (step t604.t39 (cl (= (not (>= tptp.a 0)) (< tptp.a 0))) :rule symm :premises (t604.t38))
% 0.47/0.66  (step t604.t40 (cl (< tptp.a 0)) :rule resolution :premises (t604.t37 t604.t39 t604.a0))
% 0.47/0.66  (step t604.t41 (cl (and (> 1 0) (< tptp.a 0))) :rule resolution :premises (t604.t32 t604.t36 t604.t40))
% 0.47/0.66  (step t604.t42 (cl (< (* 1 tptp.a) (* 1 0))) :rule resolution :premises (t604.t31 t604.t41))
% 0.47/0.66  (step t604.t43 (cl (< (+ (* (- 1) tptp.a) (* 1 tptp.a)) (+ (* (- 1) 9) (* 1 0)))) :rule resolution :premises (t604.t20 t604.t29 t604.t42))
% 0.47/0.66  (step t604.t44 (cl false) :rule resolution :premises (t604.t1 t604.t19 t604.t43))
% 0.47/0.66  (step t604 (cl (not (not (>= tptp.a 0))) (not (= tptp.a 9)) false) :rule subproof :discharge (t604.a0 t604.a1))
% 0.47/0.66  (step t605 (cl (not (and (not (>= tptp.a 0)) (= tptp.a 9))) (not (>= tptp.a 0))) :rule and_pos)
% 0.47/0.66  (step t606 (cl (not (and (not (>= tptp.a 0)) (= tptp.a 9))) (= tptp.a 9)) :rule and_pos)
% 0.47/0.66  (step t607 (cl false (not (and (not (>= tptp.a 0)) (= tptp.a 9))) (not (and (not (>= tptp.a 0)) (= tptp.a 9)))) :rule resolution :premises (t604 t605 t606))
% 0.47/0.66  (step t608 (cl (not (and (not (>= tptp.a 0)) (= tptp.a 9))) (not (and (not (>= tptp.a 0)) (= tptp.a 9))) false) :rule reordering :premises (t607))
% 0.47/0.66  (step t609 (cl (not (and (not (>= tptp.a 0)) (= tptp.a 9))) false) :rule contraction :premises (t608))
% 0.47/0.66  (step t610 (cl (=> (and (not (>= tptp.a 0)) (= tptp.a 9)) false) false) :rule resolution :premises (t603 t609))
% 0.47/0.66  (step t611 (cl (=> (and (not (>= tptp.a 0)) (= tptp.a 9)) false) (not false)) :rule implies_neg2)
% 0.47/0.66  (step t612 (cl (=> (and (not (>= tptp.a 0)) (= tptp.a 9)) false) (=> (and (not (>= tptp.a 0)) (= tptp.a 9)) false)) :rule resolution :premises (t610 t611))
% 0.47/0.66  (step t613 (cl (=> (and (not (>= tptp.a 0)) (= tptp.a 9)) false)) :rule contraction :premises (t612))
% 0.47/0.66  (step t614 (cl (= (=> (and (not (>= tptp.a 0)) (= tptp.a 9)) false) (not (and (not (>= tptp.a 0)) (= tptp.a 9))))) :rule implies_simplify)
% 0.47/0.66  (step t615 (cl (not (=> (and (not (>= tptp.a 0)) (= tptp.a 9)) false)) (not (and (not (>= tptp.a 0)) (= tptp.a 9)))) :rule equiv1 :premises (t614))
% 0.47/0.66  (step t616 (cl (not (and (not (>= tptp.a 0)) (= tptp.a 9)))) :rule resolution :premises (t613 t615))
% 0.47/0.66  (step t617 (cl (not (not (>= tptp.a 0))) (not (= tptp.a 9))) :rule not_and :premises (t616))
% 0.47/0.66  (step t618 (cl (or (not (not (>= tptp.a 0))) (not (= tptp.a 9))) (not (not (not (>= tptp.a 0))))) :rule or_neg)
% 0.47/0.66  (step t619 (cl (or (not (not (>= tptp.a 0))) (not (= tptp.a 9))) (not (not (= tptp.a 9)))) :rule or_neg)
% 0.47/0.66  (step t620 (cl (or (not (not (>= tptp.a 0))) (not (= tptp.a 9))) (or (not (not (>= tptp.a 0))) (not (= tptp.a 9)))) :rule resolution :premises (t617 t618 t619))
% 0.47/0.66  (step t621 (cl (or (not (not (>= tptp.a 0))) (not (= tptp.a 9)))) :rule contraction :premises (t620))
% 0.47/0.66  (step t622 (cl (or (>= tptp.a 0) (not (= tptp.a 9)))) :rule resolution :premises (t600 t602 t621))
% 0.47/0.66  (step t623 (cl (>= tptp.a 0) (not (= tptp.a 9))) :rule or :premises (t622))
% 0.47/0.66  (step t624 (cl (>= tptp.a 0)) :rule resolution :premises (t623 t597))
% 0.47/0.66  (step t625 (cl (=> (and (>= tptp.a 10) (= tptp.a 9)) false) (and (>= tptp.a 10) (= tptp.a 9))) :rule implies_neg1)
% 0.47/0.66  (anchor :step t626)
% 0.47/0.66  (assume t626.a0 (>= tptp.a 10))
% 0.47/0.66  (assume t626.a1 (= tptp.a 9))
% 0.47/0.66  (step t626.t1 (cl (not (= (<= (+ (* 1 tptp.a) (* (- 1) tptp.a)) (+ (* 1 9) (* (- 1) 10))) false)) (not (<= (+ (* 1 tptp.a) (* (- 1) tptp.a)) (+ (* 1 9) (* (- 1) 10)))) false) :rule equiv_pos2)
% 0.47/0.66  (step t626.t2 (cl (= (* 1 tptp.a) tptp.a)) :rule all_simplify)
% 0.47/0.66  (step t626.t3 (cl (= (* (- 1) tptp.a) (* (- 1) tptp.a))) :rule refl)
% 0.47/0.66  (step t626.t4 (cl (= (+ (* 1 tptp.a) (* (- 1) tptp.a)) (+ tptp.a (* (- 1) tptp.a)))) :rule cong :premises (t626.t2 t626.t3))
% 0.47/0.66  (step t626.t5 (cl (= (+ tptp.a (* (- 1) tptp.a)) 0)) :rule all_simplify)
% 0.47/0.66  (step t626.t6 (cl (= (+ (* 1 tptp.a) (* (- 1) tptp.a)) 0)) :rule trans :premises (t626.t4 t626.t5))
% 0.47/0.66  (step t626.t7 (cl (= (* 1 9) 9)) :rule all_simplify)
% 0.47/0.66  (step t626.t8 (cl (= (* (- 1) 10) (- 10))) :rule all_simplify)
% 0.47/0.66  (step t626.t9 (cl (= (+ (* 1 9) (* (- 1) 10)) (+ 9 (- 10)))) :rule cong :premises (t626.t7 t626.t8))
% 0.47/0.66  (step t626.t10 (cl (= (+ 9 (- 10)) (- 1))) :rule all_simplify)
% 0.47/0.66  (step t626.t11 (cl (= (+ (* 1 9) (* (- 1) 10)) (- 1))) :rule trans :premises (t626.t9 t626.t10))
% 0.47/0.66  (step t626.t12 (cl (= (<= (+ (* 1 tptp.a) (* (- 1) tptp.a)) (+ (* 1 9) (* (- 1) 10))) (<= 0 (- 1)))) :rule cong :premises (t626.t6 t626.t11))
% 0.47/0.66  (step t626.t13 (cl (= (<= 0 (- 1)) false)) :rule all_simplify)
% 0.47/0.66  (step t626.t14 (cl (= (<= (+ (* 1 tptp.a) (* (- 1) tptp.a)) (+ (* 1 9) (* (- 1) 10))) false)) :rule trans :premises (t626.t12 t626.t13))
% 0.47/0.66  (step t626.t15 (cl (not (= (* 1 tptp.a) (* 1 9))) (not (<= (* (- 1) tptp.a) (* (- 1) 10))) (<= (+ (* 1 tptp.a) (* (- 1) tptp.a)) (+ (* 1 9) (* (- 1) 10)))) :rule la_generic :args ((- 1) 1 1))
% 0.47/0.66  (step t626.t16 (cl (=> (and (> 1 0) (= tptp.a 9)) (= (* 1 tptp.a) (* 1 9)))) :rule la_mult_pos)
% 0.47/0.66  (step t626.t17 (cl (not (and (> 1 0) (= tptp.a 9))) (= (* 1 tptp.a) (* 1 9))) :rule implies :premises (t626.t16))
% 0.47/0.66  (step t626.t18 (cl (and (> 1 0) (= tptp.a 9)) (not (> 1 0)) (not (= tptp.a 9))) :rule and_neg)
% 0.47/0.66  (step t626.t19 (cl (= (= (> 1 0) true) (> 1 0))) :rule equiv_simplify)
% 0.47/0.66  (step t626.t20 (cl (not (= (> 1 0) true)) (> 1 0)) :rule equiv1 :premises (t626.t19))
% 0.47/0.66  (step t626.t21 (cl (= (> 1 0) true)) :rule hole :args ((> 1 0)))
% 0.47/0.66  (step t626.t22 (cl (> 1 0)) :rule resolution :premises (t626.t20 t626.t21))
% 0.47/0.66  (step t626.t23 (cl (and (> 1 0) (= tptp.a 9))) :rule resolution :premises (t626.t18 t626.t22 t626.a1))
% 0.47/0.66  (step t626.t24 (cl (= (* 1 tptp.a) (* 1 9))) :rule resolution :premises (t626.t17 t626.t23))
% 0.47/0.66  (step t626.t25 (cl (=> (and (< (- 1) 0) (>= tptp.a 10)) (<= (* (- 1) tptp.a) (* (- 1) 10)))) :rule la_mult_neg)
% 0.47/0.66  (step t626.t26 (cl (not (and (< (- 1) 0) (>= tptp.a 10))) (<= (* (- 1) tptp.a) (* (- 1) 10))) :rule implies :premises (t626.t25))
% 0.47/0.66  (step t626.t27 (cl (and (< (- 1) 0) (>= tptp.a 10)) (not (< (- 1) 0)) (not (>= tptp.a 10))) :rule and_neg)
% 0.47/0.66  (step t626.t28 (cl (= (= (< (- 1) 0) true) (< (- 1) 0))) :rule equiv_simplify)
% 0.47/0.66  (step t626.t29 (cl (not (= (< (- 1) 0) true)) (< (- 1) 0)) :rule equiv1 :premises (t626.t28))
% 0.47/0.66  (step t626.t30 (cl (= (< (- 1) 0) true)) :rule hole :args ((< (- 1) 0)))
% 0.47/0.66  (step t626.t31 (cl (< (- 1) 0)) :rule resolution :premises (t626.t29 t626.t30))
% 0.47/0.66  (step t626.t32 (cl (and (< (- 1) 0) (>= tptp.a 10))) :rule resolution :premises (t626.t27 t626.t31 t626.a0))
% 0.47/0.66  (step t626.t33 (cl (<= (* (- 1) tptp.a) (* (- 1) 10))) :rule resolution :premises (t626.t26 t626.t32))
% 0.47/0.66  (step t626.t34 (cl (<= (+ (* 1 tptp.a) (* (- 1) tptp.a)) (+ (* 1 9) (* (- 1) 10)))) :rule resolution :premises (t626.t15 t626.t24 t626.t33))
% 0.47/0.66  (step t626.t35 (cl false) :rule resolution :premises (t626.t1 t626.t14 t626.t34))
% 0.47/0.66  (step t626 (cl (not (>= tptp.a 10)) (not (= tptp.a 9)) false) :rule subproof :discharge (t626.a0 t626.a1))
% 0.47/0.66  (step t627 (cl (not (and (>= tptp.a 10) (= tptp.a 9))) (>= tptp.a 10)) :rule and_pos)
% 0.47/0.66  (step t628 (cl (not (and (>= tptp.a 10) (= tptp.a 9))) (= tptp.a 9)) :rule and_pos)
% 0.47/0.66  (step t629 (cl false (not (and (>= tptp.a 10) (= tptp.a 9))) (not (and (>= tptp.a 10) (= tptp.a 9)))) :rule resolution :premises (t626 t627 t628))
% 0.47/0.66  (step t630 (cl (not (and (>= tptp.a 10) (= tptp.a 9))) (not (and (>= tptp.a 10) (= tptp.a 9))) false) :rule reordering :premises (t629))
% 0.47/0.66  (step t631 (cl (not (and (>= tptp.a 10) (= tptp.a 9))) false) :rule contraction :premises (t630))
% 0.47/0.66  (step t632 (cl (=> (and (>= tptp.a 10) (= tptp.a 9)) false) false) :rule resolution :premises (t625 t631))
% 0.47/0.66  (step t633 (cl (=> (and (>= tptp.a 10) (= tptp.a 9)) false) (not false)) :rule implies_neg2)
% 0.47/0.66  (step t634 (cl (=> (and (>= tptp.a 10) (= tptp.a 9)) false) (=> (and (>= tptp.a 10) (= tptp.a 9)) false)) :rule resolution :premises (t632 t633))
% 0.47/0.66  (step t635 (cl (=> (and (>= tptp.a 10) (= tptp.a 9)) false)) :rule contraction :premises (t634))
% 0.47/0.66  (step t636 (cl (= (=> (and (>= tptp.a 10) (= tptp.a 9)) false) (not (and (>= tptp.a 10) (= tptp.a 9))))) :rule implies_simplify)
% 0.47/0.66  (step t637 (cl (not (=> (and (>= tptp.a 10) (= tptp.a 9)) false)) (not (and (>= tptp.a 10) (= tptp.a 9)))) :rule equiv1 :premises (t636))
% 0.47/0.66  (step t638 (cl (not (and (>= tptp.a 10) (= tptp.a 9)))) :rule resolution :premises (t635 t637))
% 0.47/0.66  (step t639 (cl (not (>= tptp.a 10)) (not (= tptp.a 9))) :rule not_and :premises (t638))
% 0.47/0.66  (step t640 (cl (not (>= tptp.a 10))) :rule resolution :premises (t639 t597))
% 0.47/0.66  (step t641 (cl) :rule resolution :premises (t23 t599 t624 t640))
% 0.47/0.66  
% 0.47/0.66  % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.YvsFOGAUxN/cvc5---1.0.5_29767.smt2
% 0.47/0.66  % cvc5---1.0.5 exiting
% 0.47/0.66  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------