TSTP Solution File: ARI674_1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : ARI674_1 : TPTP v8.2.0. Released v6.3.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n005.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:28 EDT 2024
% Result : Theorem 0.20s 0.54s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : ARI674_1 : TPTP v8.2.0. Released v6.3.0.
% 0.03/0.14 % Command : do_cvc5 %s %d
% 0.13/0.35 % Computer : n005.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon May 27 05:41:09 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.49 %----Proving TF0_ARI
% 0.20/0.54 --- Run --finite-model-find --decision=internal at 15...
% 0.20/0.54 % SZS status Theorem for /export/starexec/sandbox/tmp/tmp.EwgrzYsyUq/cvc5---1.0.5_15708.smt2
% 0.20/0.54 % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.EwgrzYsyUq/cvc5---1.0.5_15708.smt2
% 0.20/0.54 (assume a0 (<= 4 (* tptp.a tptp.a)))
% 0.20/0.54 (assume a1 (not (or (<= tptp.a (- 2)) (<= 2 tptp.a))))
% 0.20/0.54 (assume a2 true)
% 0.20/0.54 (step t1 (cl (not (= (=> (and (>= (* tptp.a tptp.a) 4) (= (* tptp.a tptp.a) 0)) (and (= (* tptp.a tptp.a) 0) (>= (* tptp.a tptp.a) 4))) (not (and (>= (* tptp.a tptp.a) 4) (= (* tptp.a tptp.a) 0))))) (not (=> (and (>= (* tptp.a tptp.a) 4) (= (* tptp.a tptp.a) 0)) (and (= (* tptp.a tptp.a) 0) (>= (* tptp.a tptp.a) 4)))) (not (and (>= (* tptp.a tptp.a) 4) (= (* tptp.a tptp.a) 0)))) :rule equiv_pos2)
% 0.20/0.54 (step t2 (cl (= (and (>= (* tptp.a tptp.a) 4) (= (* tptp.a tptp.a) 0)) (and (>= (* tptp.a tptp.a) 4) (= (* tptp.a tptp.a) 0)))) :rule refl)
% 0.20/0.54 (step t3 (cl (= (= (and (= (* tptp.a tptp.a) 0) (>= (* tptp.a tptp.a) 4)) false) (not (and (= (* tptp.a tptp.a) 0) (>= (* tptp.a tptp.a) 4))))) :rule equiv_simplify)
% 0.20/0.54 (step t4 (cl (= (and (= (* tptp.a tptp.a) 0) (>= (* tptp.a tptp.a) 4)) false) (not (not (and (= (* tptp.a tptp.a) 0) (>= (* tptp.a tptp.a) 4))))) :rule equiv2 :premises (t3))
% 0.20/0.54 (step t5 (cl (not (not (not (and (= (* tptp.a tptp.a) 0) (>= (* tptp.a tptp.a) 4))))) (and (= (* tptp.a tptp.a) 0) (>= (* tptp.a tptp.a) 4))) :rule not_not)
% 0.20/0.54 (step t6 (cl (= (and (= (* tptp.a tptp.a) 0) (>= (* tptp.a tptp.a) 4)) false) (and (= (* tptp.a tptp.a) 0) (>= (* tptp.a tptp.a) 4))) :rule resolution :premises (t4 t5))
% 0.20/0.54 (step t7 (cl (=> (and (= (* tptp.a tptp.a) 0) (>= (* tptp.a tptp.a) 4)) false) (and (= (* tptp.a tptp.a) 0) (>= (* tptp.a tptp.a) 4))) :rule implies_neg1)
% 0.20/0.54 (anchor :step t8)
% 0.20/0.54 (assume t8.a0 (= (* tptp.a tptp.a) 0))
% 0.20/0.54 (assume t8.a1 (>= (* tptp.a tptp.a) 4))
% 0.20/0.54 (step t8.t1 (cl (=> (= (* tptp.a tptp.a) 0) false) (= (* tptp.a tptp.a) 0)) :rule implies_neg1)
% 0.20/0.54 (anchor :step t8.t2)
% 0.20/0.54 (assume t8.t2.a0 (= (* tptp.a tptp.a) 0))
% 0.20/0.54 (step t8.t2.t1 (cl (not (= (<= (+ (* 1.0 (* tptp.a tptp.a)) (* (- 1.0) (* tptp.a tptp.a))) (+ (* 1.0 0) (* (- 1.0) 4))) false)) (not (<= (+ (* 1.0 (* tptp.a tptp.a)) (* (- 1.0) (* tptp.a tptp.a))) (+ (* 1.0 0) (* (- 1.0) 4)))) false) :rule equiv_pos2)
% 0.20/0.54 (step t8.t2.t2 (cl (= (* 1.0 (* tptp.a tptp.a)) (to_real (* tptp.a tptp.a)))) :rule all_simplify)
% 0.20/0.54 (step t8.t2.t3 (cl (= (* (- 1.0) (* tptp.a tptp.a)) (to_real (* (- 1) (* tptp.a tptp.a))))) :rule all_simplify)
% 0.20/0.54 (step t8.t2.t4 (cl (= (+ (* 1.0 (* tptp.a tptp.a)) (* (- 1.0) (* tptp.a tptp.a))) (+ (to_real (* tptp.a tptp.a)) (to_real (* (- 1) (* tptp.a tptp.a)))))) :rule cong :premises (t8.t2.t2 t8.t2.t3))
% 0.20/0.54 (step t8.t2.t5 (cl (= (+ (to_real (* tptp.a tptp.a)) (to_real (* (- 1) (* tptp.a tptp.a)))) 0.0)) :rule all_simplify)
% 0.20/0.54 (step t8.t2.t6 (cl (= (+ (* 1.0 (* tptp.a tptp.a)) (* (- 1.0) (* tptp.a tptp.a))) 0.0)) :rule trans :premises (t8.t2.t4 t8.t2.t5))
% 0.20/0.54 (step t8.t2.t7 (cl (= (* 1.0 0) 0.0)) :rule all_simplify)
% 0.20/0.54 (step t8.t2.t8 (cl (= (* (- 1.0) 4) (- 4.0))) :rule all_simplify)
% 0.20/0.54 (step t8.t2.t9 (cl (= (+ (* 1.0 0) (* (- 1.0) 4)) (+ 0.0 (- 4.0)))) :rule cong :premises (t8.t2.t7 t8.t2.t8))
% 0.20/0.54 (step t8.t2.t10 (cl (= (+ 0.0 (- 4.0)) (- 4.0))) :rule all_simplify)
% 0.20/0.54 (step t8.t2.t11 (cl (= (+ (* 1.0 0) (* (- 1.0) 4)) (- 4.0))) :rule trans :premises (t8.t2.t9 t8.t2.t10))
% 0.20/0.54 (step t8.t2.t12 (cl (= (<= (+ (* 1.0 (* tptp.a tptp.a)) (* (- 1.0) (* tptp.a tptp.a))) (+ (* 1.0 0) (* (- 1.0) 4))) (<= 0.0 (- 4.0)))) :rule cong :premises (t8.t2.t6 t8.t2.t11))
% 0.20/0.54 (step t8.t2.t13 (cl (= (<= 0.0 (- 4.0)) false)) :rule all_simplify)
% 0.20/0.54 (step t8.t2.t14 (cl (= (<= (+ (* 1.0 (* tptp.a tptp.a)) (* (- 1.0) (* tptp.a tptp.a))) (+ (* 1.0 0) (* (- 1.0) 4))) false)) :rule trans :premises (t8.t2.t12 t8.t2.t13))
% 0.20/0.54 (step t8.t2.t15 (cl (not (= (* 1.0 (* tptp.a tptp.a)) (* 1.0 0))) (not (<= (* (- 1.0) (* tptp.a tptp.a)) (* (- 1.0) 4))) (<= (+ (* 1.0 (* tptp.a tptp.a)) (* (- 1.0) (* tptp.a tptp.a))) (+ (* 1.0 0) (* (- 1.0) 4)))) :rule la_generic :args ((- 1) 1 1))
% 0.20/0.54 (step t8.t2.t16 (cl (=> (and (> 1.0 0) (= (* tptp.a tptp.a) 0)) (= (* 1.0 (* tptp.a tptp.a)) (* 1.0 0)))) :rule la_mult_pos)
% 0.20/0.54 (step t8.t2.t17 (cl (not (and (> 1.0 0) (= (* tptp.a tptp.a) 0))) (= (* 1.0 (* tptp.a tptp.a)) (* 1.0 0))) :rule implies :premises (t8.t2.t16))
% 0.20/0.54 (step t8.t2.t18 (cl (and (> 1.0 0) (= (* tptp.a tptp.a) 0)) (not (> 1.0 0)) (not (= (* tptp.a tptp.a) 0))) :rule and_neg)
% 0.20/0.54 (step t8.t2.t19 (cl (= (= (> 1.0 0) true) (> 1.0 0))) :rule equiv_simplify)
% 0.20/0.54 (step t8.t2.t20 (cl (not (= (> 1.0 0) true)) (> 1.0 0)) :rule equiv1 :premises (t8.t2.t19))
% 0.20/0.54 (step t8.t2.t21 (cl (= (> 1.0 0) true)) :rule hole :args ((> 1.0 0)))
% 0.20/0.54 (step t8.t2.t22 (cl (> 1.0 0)) :rule resolution :premises (t8.t2.t20 t8.t2.t21))
% 0.20/0.54 (step t8.t2.t23 (cl (and (> 1.0 0) (= (* tptp.a tptp.a) 0))) :rule resolution :premises (t8.t2.t18 t8.t2.t22 t8.t2.a0))
% 0.20/0.54 (step t8.t2.t24 (cl (= (* 1.0 (* tptp.a tptp.a)) (* 1.0 0))) :rule resolution :premises (t8.t2.t17 t8.t2.t23))
% 0.20/0.54 (step t8.t2.t25 (cl (=> (and (< (- 1.0) 0) (>= (* tptp.a tptp.a) 4)) (<= (* (- 1.0) (* tptp.a tptp.a)) (* (- 1.0) 4)))) :rule la_mult_neg)
% 0.20/0.54 (step t8.t2.t26 (cl (not (and (< (- 1.0) 0) (>= (* tptp.a tptp.a) 4))) (<= (* (- 1.0) (* tptp.a tptp.a)) (* (- 1.0) 4))) :rule implies :premises (t8.t2.t25))
% 0.20/0.54 (step t8.t2.t27 (cl (and (< (- 1.0) 0) (>= (* tptp.a tptp.a) 4)) (not (< (- 1.0) 0)) (not (>= (* tptp.a tptp.a) 4))) :rule and_neg)
% 0.20/0.54 (step t8.t2.t28 (cl (= (= (< (- 1.0) 0) true) (< (- 1.0) 0))) :rule equiv_simplify)
% 0.20/0.54 (step t8.t2.t29 (cl (not (= (< (- 1.0) 0) true)) (< (- 1.0) 0)) :rule equiv1 :premises (t8.t2.t28))
% 0.20/0.54 (step t8.t2.t30 (cl (= (< (- 1.0) 0) true)) :rule hole :args ((< (- 1.0) 0)))
% 0.20/0.54 (step t8.t2.t31 (cl (< (- 1.0) 0)) :rule resolution :premises (t8.t2.t29 t8.t2.t30))
% 0.20/0.54 (step t8.t2.t32 (cl (and (< (- 1.0) 0) (>= (* tptp.a tptp.a) 4))) :rule resolution :premises (t8.t2.t27 t8.t2.t31 t8.a1))
% 0.20/0.54 (step t8.t2.t33 (cl (<= (* (- 1.0) (* tptp.a tptp.a)) (* (- 1.0) 4))) :rule resolution :premises (t8.t2.t26 t8.t2.t32))
% 0.20/0.54 (step t8.t2.t34 (cl (<= (+ (* 1.0 (* tptp.a tptp.a)) (* (- 1.0) (* tptp.a tptp.a))) (+ (* 1.0 0) (* (- 1.0) 4)))) :rule resolution :premises (t8.t2.t15 t8.t2.t24 t8.t2.t33))
% 0.20/0.54 (step t8.t2.t35 (cl false) :rule resolution :premises (t8.t2.t1 t8.t2.t14 t8.t2.t34))
% 0.20/0.54 (step t8.t2 (cl (not (= (* tptp.a tptp.a) 0)) false) :rule subproof :discharge (t8.t2.a0))
% 0.20/0.54 (step t8.t3 (cl (=> (= (* tptp.a tptp.a) 0) false) false) :rule resolution :premises (t8.t1 t8.t2))
% 0.20/0.54 (step t8.t4 (cl (=> (= (* tptp.a tptp.a) 0) false) (not false)) :rule implies_neg2)
% 0.20/0.54 (step t8.t5 (cl (=> (= (* tptp.a tptp.a) 0) false) (=> (= (* tptp.a tptp.a) 0) false)) :rule resolution :premises (t8.t3 t8.t4))
% 0.20/0.54 (step t8.t6 (cl (=> (= (* tptp.a tptp.a) 0) false)) :rule contraction :premises (t8.t5))
% 0.20/0.54 (step t8.t7 (cl (= (=> (= (* tptp.a tptp.a) 0) false) (not (= (* tptp.a tptp.a) 0)))) :rule implies_simplify)
% 0.20/0.54 (step t8.t8 (cl (not (=> (= (* tptp.a tptp.a) 0) false)) (not (= (* tptp.a tptp.a) 0))) :rule equiv1 :premises (t8.t7))
% 0.20/0.54 (step t8.t9 (cl (not (= (* tptp.a tptp.a) 0))) :rule resolution :premises (t8.t6 t8.t8))
% 0.20/0.54 (step t8.t10 (cl) :rule resolution :premises (t8.a0 t8.t9))
% 0.20/0.54 (step t8 (cl (not (= (* tptp.a tptp.a) 0)) (not (>= (* tptp.a tptp.a) 4)) false) :rule subproof :discharge (t8.a0 t8.a1))
% 0.20/0.54 (step t9 (cl (not (and (= (* tptp.a tptp.a) 0) (>= (* tptp.a tptp.a) 4))) (= (* tptp.a tptp.a) 0)) :rule and_pos)
% 0.20/0.54 (step t10 (cl (not (and (= (* tptp.a tptp.a) 0) (>= (* tptp.a tptp.a) 4))) (>= (* tptp.a tptp.a) 4)) :rule and_pos)
% 0.20/0.54 (step t11 (cl false (not (and (= (* tptp.a tptp.a) 0) (>= (* tptp.a tptp.a) 4))) (not (and (= (* tptp.a tptp.a) 0) (>= (* tptp.a tptp.a) 4)))) :rule resolution :premises (t8 t9 t10))
% 0.20/0.54 (step t12 (cl (not (and (= (* tptp.a tptp.a) 0) (>= (* tptp.a tptp.a) 4))) (not (and (= (* tptp.a tptp.a) 0) (>= (* tptp.a tptp.a) 4))) false) :rule reordering :premises (t11))
% 0.20/0.54 (step t13 (cl (not (and (= (* tptp.a tptp.a) 0) (>= (* tptp.a tptp.a) 4))) false) :rule contraction :premises (t12))
% 0.20/0.54 (step t14 (cl (=> (and (= (* tptp.a tptp.a) 0) (>= (* tptp.a tptp.a) 4)) false) false) :rule resolution :premises (t7 t13))
% 0.20/0.54 (step t15 (cl (=> (and (= (* tptp.a tptp.a) 0) (>= (* tptp.a tptp.a) 4)) false) (not false)) :rule implies_neg2)
% 0.20/0.54 (step t16 (cl (=> (and (= (* tptp.a tptp.a) 0) (>= (* tptp.a tptp.a) 4)) false) (=> (and (= (* tptp.a tptp.a) 0) (>= (* tptp.a tptp.a) 4)) false)) :rule resolution :premises (t14 t15))
% 0.20/0.54 (step t17 (cl (=> (and (= (* tptp.a tptp.a) 0) (>= (* tptp.a tptp.a) 4)) false)) :rule contraction :premises (t16))
% 0.20/0.54 (step t18 (cl (= (=> (and (= (* tptp.a tptp.a) 0) (>= (* tptp.a tptp.a) 4)) false) (not (and (= (* tptp.a tptp.a) 0) (>= (* tptp.a tptp.a) 4))))) :rule implies_simplify)
% 0.20/0.54 (step t19 (cl (not (=> (and (= (* tptp.a tptp.a) 0) (>= (* tptp.a tptp.a) 4)) false)) (not (and (= (* tptp.a tptp.a) 0) (>= (* tptp.a tptp.a) 4)))) :rule equiv1 :premises (t18))
% 0.20/0.54 (step t20 (cl (not (and (= (* tptp.a tptp.a) 0) (>= (* tptp.a tptp.a) 4)))) :rule resolution :premises (t17 t19))
% 0.20/0.54 (step t21 (cl (= (and (= (* tptp.a tptp.a) 0) (>= (* tptp.a tptp.a) 4)) false)) :rule resolution :premises (t6 t20))
% 0.20/0.54 (step t22 (cl (= (=> (and (>= (* tptp.a tptp.a) 4) (= (* tptp.a tptp.a) 0)) (and (= (* tptp.a tptp.a) 0) (>= (* tptp.a tptp.a) 4))) (=> (and (>= (* tptp.a tptp.a) 4) (= (* tptp.a tptp.a) 0)) false))) :rule cong :premises (t2 t21))
% 0.20/0.54 (step t23 (cl (= (=> (and (>= (* tptp.a tptp.a) 4) (= (* tptp.a tptp.a) 0)) false) (not (and (>= (* tptp.a tptp.a) 4) (= (* tptp.a tptp.a) 0))))) :rule all_simplify)
% 0.20/0.54 (step t24 (cl (= (=> (and (>= (* tptp.a tptp.a) 4) (= (* tptp.a tptp.a) 0)) (and (= (* tptp.a tptp.a) 0) (>= (* tptp.a tptp.a) 4))) (not (and (>= (* tptp.a tptp.a) 4) (= (* tptp.a tptp.a) 0))))) :rule trans :premises (t22 t23))
% 0.20/0.54 (step t25 (cl (=> (and (>= (* tptp.a tptp.a) 4) (= (* tptp.a tptp.a) 0)) (and (= (* tptp.a tptp.a) 0) (>= (* tptp.a tptp.a) 4))) (and (>= (* tptp.a tptp.a) 4) (= (* tptp.a tptp.a) 0))) :rule implies_neg1)
% 0.20/0.54 (anchor :step t26)
% 0.20/0.54 (assume t26.a0 (>= (* tptp.a tptp.a) 4))
% 0.20/0.54 (assume t26.a1 (= (* tptp.a tptp.a) 0))
% 0.20/0.54 (step t26.t1 (cl (and (= (* tptp.a tptp.a) 0) (>= (* tptp.a tptp.a) 4)) (not (= (* tptp.a tptp.a) 0)) (not (>= (* tptp.a tptp.a) 4))) :rule and_neg)
% 0.20/0.54 (step t26.t2 (cl (and (= (* tptp.a tptp.a) 0) (>= (* tptp.a tptp.a) 4))) :rule resolution :premises (t26.t1 t26.a1 t26.a0))
% 0.20/0.54 (step t26 (cl (not (>= (* tptp.a tptp.a) 4)) (not (= (* tptp.a tptp.a) 0)) (and (= (* tptp.a tptp.a) 0) (>= (* tptp.a tptp.a) 4))) :rule subproof :discharge (t26.a0 t26.a1))
% 0.20/0.54 (step t27 (cl (not (and (>= (* tptp.a tptp.a) 4) (= (* tptp.a tptp.a) 0))) (>= (* tptp.a tptp.a) 4)) :rule and_pos)
% 0.20/0.54 (step t28 (cl (not (and (>= (* tptp.a tptp.a) 4) (= (* tptp.a tptp.a) 0))) (= (* tptp.a tptp.a) 0)) :rule and_pos)
% 0.20/0.54 (step t29 (cl (and (= (* tptp.a tptp.a) 0) (>= (* tptp.a tptp.a) 4)) (not (and (>= (* tptp.a tptp.a) 4) (= (* tptp.a tptp.a) 0))) (not (and (>= (* tptp.a tptp.a) 4) (= (* tptp.a tptp.a) 0)))) :rule resolution :premises (t26 t27 t28))
% 0.20/0.54 (step t30 (cl (not (and (>= (* tptp.a tptp.a) 4) (= (* tptp.a tptp.a) 0))) (not (and (>= (* tptp.a tptp.a) 4) (= (* tptp.a tptp.a) 0))) (and (= (* tptp.a tptp.a) 0) (>= (* tptp.a tptp.a) 4))) :rule reordering :premises (t29))
% 0.20/0.54 (step t31 (cl (not (and (>= (* tptp.a tptp.a) 4) (= (* tptp.a tptp.a) 0))) (and (= (* tptp.a tptp.a) 0) (>= (* tptp.a tptp.a) 4))) :rule contraction :premises (t30))
% 0.20/0.54 (step t32 (cl (=> (and (>= (* tptp.a tptp.a) 4) (= (* tptp.a tptp.a) 0)) (and (= (* tptp.a tptp.a) 0) (>= (* tptp.a tptp.a) 4))) (and (= (* tptp.a tptp.a) 0) (>= (* tptp.a tptp.a) 4))) :rule resolution :premises (t25 t31))
% 0.20/0.54 (step t33 (cl (=> (and (>= (* tptp.a tptp.a) 4) (= (* tptp.a tptp.a) 0)) (and (= (* tptp.a tptp.a) 0) (>= (* tptp.a tptp.a) 4))) (not (and (= (* tptp.a tptp.a) 0) (>= (* tptp.a tptp.a) 4)))) :rule implies_neg2)
% 0.20/0.54 (step t34 (cl (=> (and (>= (* tptp.a tptp.a) 4) (= (* tptp.a tptp.a) 0)) (and (= (* tptp.a tptp.a) 0) (>= (* tptp.a tptp.a) 4))) (=> (and (>= (* tptp.a tptp.a) 4) (= (* tptp.a tptp.a) 0)) (and (= (* tptp.a tptp.a) 0) (>= (* tptp.a tptp.a) 4)))) :rule resolution :premises (t32 t33))
% 0.20/0.54 (step t35 (cl (=> (and (>= (* tptp.a tptp.a) 4) (= (* tptp.a tptp.a) 0)) (and (= (* tptp.a tptp.a) 0) (>= (* tptp.a tptp.a) 4)))) :rule contraction :premises (t34))
% 0.20/0.54 (step t36 (cl (not (and (>= (* tptp.a tptp.a) 4) (= (* tptp.a tptp.a) 0)))) :rule resolution :premises (t1 t24 t35))
% 0.20/0.54 (step t37 (cl (not (>= (* tptp.a tptp.a) 4)) (not (= (* tptp.a tptp.a) 0))) :rule not_and :premises (t36))
% 0.20/0.54 (step t38 (cl (=> (= tptp.a 0) (= (* tptp.a tptp.a) 0)) (= tptp.a 0)) :rule implies_neg1)
% 0.20/0.54 (anchor :step t39)
% 0.20/0.54 (assume t39.a0 (= tptp.a 0))
% 0.20/0.54 (step t39.t1 (cl (= (= (= (* tptp.a tptp.a) 0) true) (= (* tptp.a tptp.a) 0))) :rule equiv_simplify)
% 0.20/0.54 (step t39.t2 (cl (not (= (= (* tptp.a tptp.a) 0) true)) (= (* tptp.a tptp.a) 0)) :rule equiv1 :premises (t39.t1))
% 0.20/0.54 (step t39.t3 (cl (= (* tptp.a tptp.a) (* 0 0))) :rule cong :premises (t39.a0 t39.a0))
% 0.20/0.54 (step t39.t4 (cl (= 0 0)) :rule refl)
% 0.20/0.54 (step t39.t5 (cl (= (= (* tptp.a tptp.a) 0) (= (* 0 0) 0))) :rule cong :premises (t39.t3 t39.t4))
% 0.20/0.54 (step t39.t6 (cl (= (* 0 0) 0)) :rule all_simplify)
% 0.20/0.54 (step t39.t7 (cl (= 0 0)) :rule refl)
% 0.20/0.54 (step t39.t8 (cl (= (= (* 0 0) 0) (= 0 0))) :rule cong :premises (t39.t6 t39.t7))
% 0.20/0.54 (step t39.t9 (cl (= (= 0 0) true)) :rule all_simplify)
% 0.20/0.54 (step t39.t10 (cl (= (= (* 0 0) 0) true)) :rule trans :premises (t39.t8 t39.t9))
% 0.20/0.54 (step t39.t11 (cl (= (= (* tptp.a tptp.a) 0) true)) :rule trans :premises (t39.t5 t39.t10))
% 0.20/0.54 (step t39.t12 (cl (= (* tptp.a tptp.a) 0)) :rule resolution :premises (t39.t2 t39.t11))
% 0.20/0.54 (step t39 (cl (not (= tptp.a 0)) (= (* tptp.a tptp.a) 0)) :rule subproof :discharge (t39.a0))
% 0.20/0.54 (step t40 (cl (=> (= tptp.a 0) (= (* tptp.a tptp.a) 0)) (= (* tptp.a tptp.a) 0)) :rule resolution :premises (t38 t39))
% 0.20/0.54 (step t41 (cl (=> (= tptp.a 0) (= (* tptp.a tptp.a) 0)) (not (= (* tptp.a tptp.a) 0))) :rule implies_neg2)
% 0.20/0.54 (step t42 (cl (=> (= tptp.a 0) (= (* tptp.a tptp.a) 0)) (=> (= tptp.a 0) (= (* tptp.a tptp.a) 0))) :rule resolution :premises (t40 t41))
% 0.20/0.54 (step t43 (cl (=> (= tptp.a 0) (= (* tptp.a tptp.a) 0))) :rule contraction :premises (t42))
% 0.20/0.54 (step t44 (cl (not (= tptp.a 0)) (= (* tptp.a tptp.a) 0)) :rule implies :premises (t43))
% 0.20/0.54 (step t45 (cl (= (* tptp.a tptp.a) 0) (not (= tptp.a 0))) :rule reordering :premises (t44))
% 0.20/0.54 (step t46 (cl (not (= (or (not (not (>= tptp.a 2))) (not (>= tptp.a 0)) (not (not (= tptp.a 1))) (= tptp.a 0)) (or (>= tptp.a 2) (not (>= tptp.a 0)) (= tptp.a 1) (= tptp.a 0)))) (not (or (not (not (>= tptp.a 2))) (not (>= tptp.a 0)) (not (not (= tptp.a 1))) (= tptp.a 0))) (or (>= tptp.a 2) (not (>= tptp.a 0)) (= tptp.a 1) (= tptp.a 0))) :rule equiv_pos2)
% 0.20/0.54 (step t47 (cl (= (= (= (not (not (>= tptp.a 2))) (>= tptp.a 2)) true) (= (not (not (>= tptp.a 2))) (>= tptp.a 2)))) :rule equiv_simplify)
% 0.20/0.54 (step t48 (cl (not (= (= (not (not (>= tptp.a 2))) (>= tptp.a 2)) true)) (= (not (not (>= tptp.a 2))) (>= tptp.a 2))) :rule equiv1 :premises (t47))
% 0.20/0.54 (step t49 (cl (= (= (not (not (>= tptp.a 2))) (>= tptp.a 2)) (= (>= tptp.a 2) (not (not (>= tptp.a 2)))))) :rule all_simplify)
% 0.20/0.54 (step t50 (cl (= (>= tptp.a 2) (>= tptp.a 2))) :rule refl)
% 0.20/0.54 (step t51 (cl (= (not (not (>= tptp.a 2))) (>= tptp.a 2))) :rule all_simplify)
% 0.20/0.54 (step t52 (cl (= (= (>= tptp.a 2) (not (not (>= tptp.a 2)))) (= (>= tptp.a 2) (>= tptp.a 2)))) :rule cong :premises (t50 t51))
% 0.20/0.54 (step t53 (cl (= (= (>= tptp.a 2) (>= tptp.a 2)) true)) :rule all_simplify)
% 0.20/0.54 (step t54 (cl (= (= (>= tptp.a 2) (not (not (>= tptp.a 2)))) true)) :rule trans :premises (t52 t53))
% 0.20/0.54 (step t55 (cl (= (= (not (not (>= tptp.a 2))) (>= tptp.a 2)) true)) :rule trans :premises (t49 t54))
% 0.20/0.54 (step t56 (cl (= (not (not (>= tptp.a 2))) (>= tptp.a 2))) :rule resolution :premises (t48 t55))
% 0.20/0.54 (step t57 (cl (= (not (>= tptp.a 0)) (not (>= tptp.a 0)))) :rule refl)
% 0.20/0.54 (step t58 (cl (= (= (= (not (not (= tptp.a 1))) (= tptp.a 1)) true) (= (not (not (= tptp.a 1))) (= tptp.a 1)))) :rule equiv_simplify)
% 0.20/0.54 (step t59 (cl (not (= (= (not (not (= tptp.a 1))) (= tptp.a 1)) true)) (= (not (not (= tptp.a 1))) (= tptp.a 1))) :rule equiv1 :premises (t58))
% 0.20/0.54 (step t60 (cl (= (= (not (not (= tptp.a 1))) (= tptp.a 1)) (= (= tptp.a 1) (not (not (= tptp.a 1)))))) :rule all_simplify)
% 0.20/0.54 (step t61 (cl (= (= tptp.a 1) (= tptp.a 1))) :rule refl)
% 0.20/0.54 (step t62 (cl (= (not (not (= tptp.a 1))) (= tptp.a 1))) :rule all_simplify)
% 0.20/0.54 (step t63 (cl (= (= (= tptp.a 1) (not (not (= tptp.a 1)))) (= (= tptp.a 1) (= tptp.a 1)))) :rule cong :premises (t61 t62))
% 0.20/0.54 (step t64 (cl (= (= (= tptp.a 1) (= tptp.a 1)) true)) :rule all_simplify)
% 0.20/0.54 (step t65 (cl (= (= (= tptp.a 1) (not (not (= tptp.a 1)))) true)) :rule trans :premises (t63 t64))
% 0.20/0.54 (step t66 (cl (= (= (not (not (= tptp.a 1))) (= tptp.a 1)) true)) :rule trans :premises (t60 t65))
% 0.20/0.54 (step t67 (cl (= (not (not (= tptp.a 1))) (= tptp.a 1))) :rule resolution :premises (t59 t66))
% 0.20/0.54 (step t68 (cl (= (= tptp.a 0) (= tptp.a 0))) :rule refl)
% 0.20/0.54 (step t69 (cl (= (or (not (not (>= tptp.a 2))) (not (>= tptp.a 0)) (not (not (= tptp.a 1))) (= tptp.a 0)) (or (>= tptp.a 2) (not (>= tptp.a 0)) (= tptp.a 1) (= tptp.a 0)))) :rule cong :premises (t56 t57 t67 t68))
% 0.20/0.54 (step t70 (cl (and (not (>= tptp.a 2)) (>= tptp.a 0) (not (= tptp.a 1))) (not (not (>= tptp.a 2))) (not (>= tptp.a 0)) (not (not (= tptp.a 1)))) :rule and_neg)
% 0.20/0.54 (step t71 (cl (=> (and (not (>= tptp.a 2)) (>= tptp.a 0) (not (= tptp.a 1))) (= tptp.a 0)) (and (not (>= tptp.a 2)) (>= tptp.a 0) (not (= tptp.a 1)))) :rule implies_neg1)
% 0.20/0.54 (anchor :step t72)
% 0.20/0.54 (assume t72.a0 (not (>= tptp.a 2)))
% 0.20/0.54 (assume t72.a1 (>= tptp.a 0))
% 0.20/0.54 (assume t72.a2 (not (= tptp.a 1)))
% 0.20/0.54 (step t72.t1 (cl (=> (and (>= tptp.a 0) (not (>= tptp.a 1))) (= tptp.a 0)) (and (>= tptp.a 0) (not (>= tptp.a 1)))) :rule implies_neg1)
% 0.20/0.54 (anchor :step t72.t2)
% 0.20/0.54 (assume t72.t2.a0 (>= tptp.a 0))
% 0.20/0.54 (assume t72.t2.a1 (not (>= tptp.a 1)))
% 0.20/0.54 (step t72.t2.t1 (cl (or (= tptp.a 0) (not (<= tptp.a 0)) (not (<= 0 tptp.a)))) :rule la_disequality)
% 0.20/0.54 (step t72.t2.t2 (cl (= tptp.a 0) (not (<= tptp.a 0)) (not (<= 0 tptp.a))) :rule or :premises (t72.t2.t1))
% 0.20/0.54 (step t72.t2.t3 (cl (not (= (>= tptp.a 0) (<= 0 tptp.a))) (not (>= tptp.a 0)) (<= 0 tptp.a)) :rule equiv_pos2)
% 0.20/0.54 (step t72.t2.t4 (cl (= (>= tptp.a 0) (<= 0 tptp.a))) :rule comp_simplify)
% 0.20/0.54 (step t72.t2.t5 (cl (<= 0 tptp.a)) :rule resolution :premises (t72.t2.t3 t72.t2.t4 t72.t2.a0))
% 0.20/0.54 (step t72.t2.t6 (cl (not (< tptp.a 1)) (<= tptp.a 0)) :rule la_generic :args (1 1))
% 0.20/0.54 (step t72.t2.t7 (cl (not (= (not (>= tptp.a 1)) (< tptp.a 1))) (not (not (>= tptp.a 1))) (< tptp.a 1)) :rule equiv_pos2)
% 0.20/0.54 (step t72.t2.t8 (cl (= (< tptp.a 1) (not (>= tptp.a 1)))) :rule all_simplify)
% 0.20/0.54 (step t72.t2.t9 (cl (= (not (>= tptp.a 1)) (< tptp.a 1))) :rule symm :premises (t72.t2.t8))
% 0.20/0.54 (step t72.t2.t10 (cl (< tptp.a 1)) :rule resolution :premises (t72.t2.t7 t72.t2.t9 t72.t2.a1))
% 0.20/0.54 (step t72.t2.t11 (cl (<= tptp.a 0)) :rule resolution :premises (t72.t2.t6 t72.t2.t10))
% 0.20/0.54 (step t72.t2.t12 (cl (= tptp.a 0)) :rule resolution :premises (t72.t2.t2 t72.t2.t5 t72.t2.t11))
% 0.20/0.54 (step t72.t2 (cl (not (>= tptp.a 0)) (not (not (>= tptp.a 1))) (= tptp.a 0)) :rule subproof :discharge (t72.t2.a0 t72.t2.a1))
% 0.20/0.54 (step t72.t3 (cl (not (and (>= tptp.a 0) (not (>= tptp.a 1)))) (>= tptp.a 0)) :rule and_pos)
% 0.20/0.54 (step t72.t4 (cl (not (and (>= tptp.a 0) (not (>= tptp.a 1)))) (not (>= tptp.a 1))) :rule and_pos)
% 0.20/0.54 (step t72.t5 (cl (= tptp.a 0) (not (and (>= tptp.a 0) (not (>= tptp.a 1)))) (not (and (>= tptp.a 0) (not (>= tptp.a 1))))) :rule resolution :premises (t72.t2 t72.t3 t72.t4))
% 0.20/0.54 (step t72.t6 (cl (not (and (>= tptp.a 0) (not (>= tptp.a 1)))) (not (and (>= tptp.a 0) (not (>= tptp.a 1)))) (= tptp.a 0)) :rule reordering :premises (t72.t5))
% 0.20/0.54 (step t72.t7 (cl (not (and (>= tptp.a 0) (not (>= tptp.a 1)))) (= tptp.a 0)) :rule contraction :premises (t72.t6))
% 0.20/0.54 (step t72.t8 (cl (=> (and (>= tptp.a 0) (not (>= tptp.a 1))) (= tptp.a 0)) (= tptp.a 0)) :rule resolution :premises (t72.t1 t72.t7))
% 0.20/0.54 (step t72.t9 (cl (=> (and (>= tptp.a 0) (not (>= tptp.a 1))) (= tptp.a 0)) (not (= tptp.a 0))) :rule implies_neg2)
% 0.20/0.54 (step t72.t10 (cl (=> (and (>= tptp.a 0) (not (>= tptp.a 1))) (= tptp.a 0)) (=> (and (>= tptp.a 0) (not (>= tptp.a 1))) (= tptp.a 0))) :rule resolution :premises (t72.t8 t72.t9))
% 0.20/0.54 (step t72.t11 (cl (=> (and (>= tptp.a 0) (not (>= tptp.a 1))) (= tptp.a 0))) :rule contraction :premises (t72.t10))
% 0.20/0.54 (step t72.t12 (cl (not (and (>= tptp.a 0) (not (>= tptp.a 1)))) (= tptp.a 0)) :rule implies :premises (t72.t11))
% 0.20/0.54 (step t72.t13 (cl (and (>= tptp.a 0) (not (>= tptp.a 1))) (not (>= tptp.a 0)) (not (not (>= tptp.a 1)))) :rule and_neg)
% 0.20/0.54 (step t72.t14 (cl (=> (and (not (>= tptp.a 2)) (not (= tptp.a 1))) (not (>= tptp.a 1))) (and (not (>= tptp.a 2)) (not (= tptp.a 1)))) :rule implies_neg1)
% 0.20/0.54 (anchor :step t72.t15)
% 0.20/0.54 (assume t72.t15.a0 (not (>= tptp.a 2)))
% 0.20/0.54 (assume t72.t15.a1 (not (= tptp.a 1)))
% 0.20/0.54 (step t72.t15.t1 (cl (not (= (< tptp.a 1) (not (>= tptp.a 1)))) (not (< tptp.a 1)) (not (>= tptp.a 1))) :rule equiv_pos2)
% 0.20/0.54 (step t72.t15.t2 (cl (= (< tptp.a 1) (not (>= tptp.a 1)))) :rule all_simplify)
% 0.20/0.54 (step t72.t15.t3 (cl (or (= tptp.a 1) (not (<= tptp.a 1)) (not (<= 1 tptp.a)))) :rule la_disequality)
% 0.20/0.54 (step t72.t15.t4 (cl (= tptp.a 1) (not (<= tptp.a 1)) (not (<= 1 tptp.a))) :rule or :premises (t72.t15.t3))
% 0.20/0.54 (step t72.t15.t5 (cl (not (< tptp.a 2)) (<= tptp.a 1)) :rule la_generic :args (1 1))
% 0.20/0.54 (step t72.t15.t6 (cl (not (= (not (>= tptp.a 2)) (< tptp.a 2))) (not (not (>= tptp.a 2))) (< tptp.a 2)) :rule equiv_pos2)
% 0.20/0.54 (step t72.t15.t7 (cl (= (< tptp.a 2) (not (>= tptp.a 2)))) :rule all_simplify)
% 0.20/0.54 (step t72.t15.t8 (cl (= (not (>= tptp.a 2)) (< tptp.a 2))) :rule symm :premises (t72.t15.t7))
% 0.20/0.54 (step t72.t15.t9 (cl (< tptp.a 2)) :rule resolution :premises (t72.t15.t6 t72.t15.t8 t72.t15.a0))
% 0.20/0.54 (step t72.t15.t10 (cl (<= tptp.a 1)) :rule resolution :premises (t72.t15.t5 t72.t15.t9))
% 0.20/0.54 (step t72.t15.t11 (cl (not (<= 1 tptp.a))) :rule resolution :premises (t72.t15.t4 t72.t15.t10 t72.t15.a1))
% 0.20/0.54 (step t72.t15.t12 (cl (not (= (< tptp.a 1) (not (<= 1 tptp.a)))) (< tptp.a 1) (not (not (<= 1 tptp.a)))) :rule equiv_pos1)
% 0.20/0.54 (step t72.t15.t13 (cl (= (< tptp.a 1) (not (<= 1 tptp.a)))) :rule comp_simplify)
% 0.20/0.54 (step t72.t15.t14 (cl (< tptp.a 1)) :rule resolution :premises (t72.t15.t11 t72.t15.t12 t72.t15.t13))
% 0.20/0.54 (step t72.t15.t15 (cl (not (>= tptp.a 1))) :rule resolution :premises (t72.t15.t1 t72.t15.t2 t72.t15.t14))
% 0.20/0.54 (step t72.t15 (cl (not (not (>= tptp.a 2))) (not (not (= tptp.a 1))) (not (>= tptp.a 1))) :rule subproof :discharge (t72.t15.a0 t72.t15.a1))
% 0.20/0.54 (step t72.t16 (cl (not (and (not (>= tptp.a 2)) (not (= tptp.a 1)))) (not (>= tptp.a 2))) :rule and_pos)
% 0.20/0.54 (step t72.t17 (cl (not (and (not (>= tptp.a 2)) (not (= tptp.a 1)))) (not (= tptp.a 1))) :rule and_pos)
% 0.20/0.54 (step t72.t18 (cl (not (>= tptp.a 1)) (not (and (not (>= tptp.a 2)) (not (= tptp.a 1)))) (not (and (not (>= tptp.a 2)) (not (= tptp.a 1))))) :rule resolution :premises (t72.t15 t72.t16 t72.t17))
% 0.20/0.54 (step t72.t19 (cl (not (and (not (>= tptp.a 2)) (not (= tptp.a 1)))) (not (and (not (>= tptp.a 2)) (not (= tptp.a 1)))) (not (>= tptp.a 1))) :rule reordering :premises (t72.t18))
% 0.20/0.54 (step t72.t20 (cl (not (and (not (>= tptp.a 2)) (not (= tptp.a 1)))) (not (>= tptp.a 1))) :rule contraction :premises (t72.t19))
% 0.20/0.54 (step t72.t21 (cl (=> (and (not (>= tptp.a 2)) (not (= tptp.a 1))) (not (>= tptp.a 1))) (not (>= tptp.a 1))) :rule resolution :premises (t72.t14 t72.t20))
% 0.20/0.54 (step t72.t22 (cl (=> (and (not (>= tptp.a 2)) (not (= tptp.a 1))) (not (>= tptp.a 1))) (not (not (>= tptp.a 1)))) :rule implies_neg2)
% 0.20/0.54 (step t72.t23 (cl (=> (and (not (>= tptp.a 2)) (not (= tptp.a 1))) (not (>= tptp.a 1))) (=> (and (not (>= tptp.a 2)) (not (= tptp.a 1))) (not (>= tptp.a 1)))) :rule resolution :premises (t72.t21 t72.t22))
% 0.20/0.54 (step t72.t24 (cl (=> (and (not (>= tptp.a 2)) (not (= tptp.a 1))) (not (>= tptp.a 1)))) :rule contraction :premises (t72.t23))
% 0.20/0.54 (step t72.t25 (cl (not (and (not (>= tptp.a 2)) (not (= tptp.a 1)))) (not (>= tptp.a 1))) :rule implies :premises (t72.t24))
% 0.20/0.54 (step t72.t26 (cl (and (not (>= tptp.a 2)) (not (= tptp.a 1))) (not (not (>= tptp.a 2))) (not (not (= tptp.a 1)))) :rule and_neg)
% 0.20/0.54 (step t72.t27 (cl (and (not (>= tptp.a 2)) (not (= tptp.a 1)))) :rule resolution :premises (t72.t26 t72.a0 t72.a2))
% 0.20/0.54 (step t72.t28 (cl (not (>= tptp.a 1))) :rule resolution :premises (t72.t25 t72.t27))
% 0.20/0.54 (step t72.t29 (cl (and (>= tptp.a 0) (not (>= tptp.a 1)))) :rule resolution :premises (t72.t13 t72.a1 t72.t28))
% 0.20/0.54 (step t72.t30 (cl (= tptp.a 0)) :rule resolution :premises (t72.t12 t72.t29))
% 0.20/0.54 (step t72 (cl (not (not (>= tptp.a 2))) (not (>= tptp.a 0)) (not (not (= tptp.a 1))) (= tptp.a 0)) :rule subproof :discharge (t72.a0 t72.a1 t72.a2))
% 0.20/0.54 (step t73 (cl (not (and (not (>= tptp.a 2)) (>= tptp.a 0) (not (= tptp.a 1)))) (not (>= tptp.a 2))) :rule and_pos)
% 0.20/0.54 (step t74 (cl (not (and (not (>= tptp.a 2)) (>= tptp.a 0) (not (= tptp.a 1)))) (>= tptp.a 0)) :rule and_pos)
% 0.20/0.54 (step t75 (cl (not (and (not (>= tptp.a 2)) (>= tptp.a 0) (not (= tptp.a 1)))) (not (= tptp.a 1))) :rule and_pos)
% 0.20/0.54 (step t76 (cl (= tptp.a 0) (not (and (not (>= tptp.a 2)) (>= tptp.a 0) (not (= tptp.a 1)))) (not (and (not (>= tptp.a 2)) (>= tptp.a 0) (not (= tptp.a 1)))) (not (and (not (>= tptp.a 2)) (>= tptp.a 0) (not (= tptp.a 1))))) :rule resolution :premises (t72 t73 t74 t75))
% 0.20/0.54 (step t77 (cl (not (and (not (>= tptp.a 2)) (>= tptp.a 0) (not (= tptp.a 1)))) (not (and (not (>= tptp.a 2)) (>= tptp.a 0) (not (= tptp.a 1)))) (not (and (not (>= tptp.a 2)) (>= tptp.a 0) (not (= tptp.a 1)))) (= tptp.a 0)) :rule reordering :premises (t76))
% 0.20/0.54 (step t78 (cl (not (and (not (>= tptp.a 2)) (>= tptp.a 0) (not (= tptp.a 1)))) (= tptp.a 0)) :rule contraction :premises (t77))
% 0.20/0.54 (step t79 (cl (=> (and (not (>= tptp.a 2)) (>= tptp.a 0) (not (= tptp.a 1))) (= tptp.a 0)) (= tptp.a 0)) :rule resolution :premises (t71 t78))
% 0.20/0.54 (step t80 (cl (=> (and (not (>= tptp.a 2)) (>= tptp.a 0) (not (= tptp.a 1))) (= tptp.a 0)) (not (= tptp.a 0))) :rule implies_neg2)
% 0.20/0.54 (step t81 (cl (=> (and (not (>= tptp.a 2)) (>= tptp.a 0) (not (= tptp.a 1))) (= tptp.a 0)) (=> (and (not (>= tptp.a 2)) (>= tptp.a 0) (not (= tptp.a 1))) (= tptp.a 0))) :rule resolution :premises (t79 t80))
% 0.20/0.54 (step t82 (cl (=> (and (not (>= tptp.a 2)) (>= tptp.a 0) (not (= tptp.a 1))) (= tptp.a 0))) :rule contraction :premises (t81))
% 0.20/0.54 (step t83 (cl (not (and (not (>= tptp.a 2)) (>= tptp.a 0) (not (= tptp.a 1)))) (= tptp.a 0)) :rule implies :premises (t82))
% 0.20/0.54 (step t84 (cl (not (not (>= tptp.a 2))) (not (>= tptp.a 0)) (not (not (= tptp.a 1))) (= tptp.a 0)) :rule resolution :premises (t70 t83))
% 0.20/0.54 (step t85 (cl (or (not (not (>= tptp.a 2))) (not (>= tptp.a 0)) (not (not (= tptp.a 1))) (= tptp.a 0)) (not (not (not (>= tptp.a 2))))) :rule or_neg)
% 0.20/0.54 (step t86 (cl (or (not (not (>= tptp.a 2))) (not (>= tptp.a 0)) (not (not (= tptp.a 1))) (= tptp.a 0)) (not (not (>= tptp.a 0)))) :rule or_neg)
% 0.20/0.54 (step t87 (cl (or (not (not (>= tptp.a 2))) (not (>= tptp.a 0)) (not (not (= tptp.a 1))) (= tptp.a 0)) (not (not (not (= tptp.a 1))))) :rule or_neg)
% 0.20/0.54 (step t88 (cl (or (not (not (>= tptp.a 2))) (not (>= tptp.a 0)) (not (not (= tptp.a 1))) (= tptp.a 0)) (not (= tptp.a 0))) :rule or_neg)
% 0.20/0.54 (step t89 (cl (or (not (not (>= tptp.a 2))) (not (>= tptp.a 0)) (not (not (= tptp.a 1))) (= tptp.a 0)) (or (not (not (>= tptp.a 2))) (not (>= tptp.a 0)) (not (not (= tptp.a 1))) (= tptp.a 0)) (or (not (not (>= tptp.a 2))) (not (>= tptp.a 0)) (not (not (= tptp.a 1))) (= tptp.a 0)) (or (not (not (>= tptp.a 2))) (not (>= tptp.a 0)) (not (not (= tptp.a 1))) (= tptp.a 0))) :rule resolution :premises (t84 t85 t86 t87 t88))
% 0.20/0.54 (step t90 (cl (or (not (not (>= tptp.a 2))) (not (>= tptp.a 0)) (not (not (= tptp.a 1))) (= tptp.a 0))) :rule contraction :premises (t89))
% 0.20/0.54 (step t91 (cl (or (>= tptp.a 2) (not (>= tptp.a 0)) (= tptp.a 1) (= tptp.a 0))) :rule resolution :premises (t46 t69 t90))
% 0.20/0.54 (step t92 (cl (>= tptp.a 2) (not (>= tptp.a 0)) (= tptp.a 1) (= tptp.a 0)) :rule or :premises (t91))
% 0.20/0.54 (step t93 (cl (>= tptp.a 2) (= tptp.a 0) (not (>= tptp.a 0)) (= tptp.a 1)) :rule reordering :premises (t92))
% 0.20/0.54 (step t94 (cl (not (= (not (or (<= tptp.a (- 2)) (<= 2 tptp.a))) (not (or (not (>= tptp.a (- 1))) (>= tptp.a 2))))) (not (not (or (<= tptp.a (- 2)) (<= 2 tptp.a)))) (not (or (not (>= tptp.a (- 1))) (>= tptp.a 2)))) :rule equiv_pos2)
% 0.20/0.54 (step t95 (cl (= (<= tptp.a (- 2)) (not (>= tptp.a (- 1))))) :rule all_simplify)
% 0.20/0.54 (step t96 (cl (= (<= 2 tptp.a) (>= tptp.a 2))) :rule all_simplify)
% 0.20/0.54 (step t97 (cl (= (or (<= tptp.a (- 2)) (<= 2 tptp.a)) (or (not (>= tptp.a (- 1))) (>= tptp.a 2)))) :rule cong :premises (t95 t96))
% 0.20/0.54 (step t98 (cl (= (not (or (<= tptp.a (- 2)) (<= 2 tptp.a))) (not (or (not (>= tptp.a (- 1))) (>= tptp.a 2))))) :rule cong :premises (t97))
% 0.20/0.54 (step t99 (cl (not (or (not (>= tptp.a (- 1))) (>= tptp.a 2)))) :rule resolution :premises (t94 t98 a1))
% 0.20/0.54 (step t100 (cl (not (>= tptp.a 2))) :rule not_or :premises (t99))
% 0.20/0.54 (step t101 (cl (not (= (or (not (>= tptp.a (- 1))) (not (not (>= tptp.a 0))) (not (not (= tptp.a (- 1))))) (or (not (>= tptp.a (- 1))) (>= tptp.a 0) (= tptp.a (- 1))))) (not (or (not (>= tptp.a (- 1))) (not (not (>= tptp.a 0))) (not (not (= tptp.a (- 1)))))) (or (not (>= tptp.a (- 1))) (>= tptp.a 0) (= tptp.a (- 1)))) :rule equiv_pos2)
% 0.20/0.54 (step t102 (cl (= (not (>= tptp.a (- 1))) (not (>= tptp.a (- 1))))) :rule refl)
% 0.20/0.54 (step t103 (cl (= (= (= (not (not (>= tptp.a 0))) (>= tptp.a 0)) true) (= (not (not (>= tptp.a 0))) (>= tptp.a 0)))) :rule equiv_simplify)
% 0.20/0.54 (step t104 (cl (not (= (= (not (not (>= tptp.a 0))) (>= tptp.a 0)) true)) (= (not (not (>= tptp.a 0))) (>= tptp.a 0))) :rule equiv1 :premises (t103))
% 0.20/0.54 (step t105 (cl (= (= (not (not (>= tptp.a 0))) (>= tptp.a 0)) (= (>= tptp.a 0) (not (not (>= tptp.a 0)))))) :rule all_simplify)
% 0.20/0.54 (step t106 (cl (= (>= tptp.a 0) (>= tptp.a 0))) :rule refl)
% 0.20/0.54 (step t107 (cl (= (not (not (>= tptp.a 0))) (>= tptp.a 0))) :rule all_simplify)
% 0.20/0.54 (step t108 (cl (= (= (>= tptp.a 0) (not (not (>= tptp.a 0)))) (= (>= tptp.a 0) (>= tptp.a 0)))) :rule cong :premises (t106 t107))
% 0.20/0.54 (step t109 (cl (= (= (>= tptp.a 0) (>= tptp.a 0)) true)) :rule all_simplify)
% 0.20/0.54 (step t110 (cl (= (= (>= tptp.a 0) (not (not (>= tptp.a 0)))) true)) :rule trans :premises (t108 t109))
% 0.20/0.54 (step t111 (cl (= (= (not (not (>= tptp.a 0))) (>= tptp.a 0)) true)) :rule trans :premises (t105 t110))
% 0.20/0.54 (step t112 (cl (= (not (not (>= tptp.a 0))) (>= tptp.a 0))) :rule resolution :premises (t104 t111))
% 0.20/0.54 (step t113 (cl (= (= (= (not (not (= tptp.a (- 1)))) (= tptp.a (- 1))) true) (= (not (not (= tptp.a (- 1)))) (= tptp.a (- 1))))) :rule equiv_simplify)
% 0.20/0.54 (step t114 (cl (not (= (= (not (not (= tptp.a (- 1)))) (= tptp.a (- 1))) true)) (= (not (not (= tptp.a (- 1)))) (= tptp.a (- 1)))) :rule equiv1 :premises (t113))
% 0.20/0.54 (step t115 (cl (= (= (not (not (= tptp.a (- 1)))) (= tptp.a (- 1))) (= (= tptp.a (- 1)) (not (not (= tptp.a (- 1))))))) :rule all_simplify)
% 0.20/0.54 (step t116 (cl (= (= tptp.a (- 1)) (= tptp.a (- 1)))) :rule refl)
% 0.20/0.54 (step t117 (cl (= (not (not (= tptp.a (- 1)))) (= tptp.a (- 1)))) :rule all_simplify)
% 0.20/0.54 (step t118 (cl (= (= (= tptp.a (- 1)) (not (not (= tptp.a (- 1))))) (= (= tptp.a (- 1)) (= tptp.a (- 1))))) :rule cong :premises (t116 t117))
% 0.20/0.54 (step t119 (cl (= (= (= tptp.a (- 1)) (= tptp.a (- 1))) true)) :rule all_simplify)
% 0.20/0.54 (step t120 (cl (= (= (= tptp.a (- 1)) (not (not (= tptp.a (- 1))))) true)) :rule trans :premises (t118 t119))
% 0.20/0.54 (step t121 (cl (= (= (not (not (= tptp.a (- 1)))) (= tptp.a (- 1))) true)) :rule trans :premises (t115 t120))
% 0.20/0.54 (step t122 (cl (= (not (not (= tptp.a (- 1)))) (= tptp.a (- 1)))) :rule resolution :premises (t114 t121))
% 0.20/0.54 (step t123 (cl (= (or (not (>= tptp.a (- 1))) (not (not (>= tptp.a 0))) (not (not (= tptp.a (- 1))))) (or (not (>= tptp.a (- 1))) (>= tptp.a 0) (= tptp.a (- 1))))) :rule cong :premises (t102 t112 t122))
% 0.20/0.54 (step t124 (cl (not (= (=> (and (>= tptp.a (- 1)) (not (>= tptp.a 0)) (not (= tptp.a (- 1)))) (and (not (= tptp.a (- 1))) (not (>= tptp.a 0)) (>= tptp.a (- 1)))) (not (and (>= tptp.a (- 1)) (not (>= tptp.a 0)) (not (= tptp.a (- 1))))))) (not (=> (and (>= tptp.a (- 1)) (not (>= tptp.a 0)) (not (= tptp.a (- 1)))) (and (not (= tptp.a (- 1))) (not (>= tptp.a 0)) (>= tptp.a (- 1))))) (not (and (>= tptp.a (- 1)) (not (>= tptp.a 0)) (not (= tptp.a (- 1)))))) :rule equiv_pos2)
% 0.20/0.54 (step t125 (cl (= (and (>= tptp.a (- 1)) (not (>= tptp.a 0)) (not (= tptp.a (- 1)))) (and (>= tptp.a (- 1)) (not (>= tptp.a 0)) (not (= tptp.a (- 1)))))) :rule refl)
% 0.20/0.54 (step t126 (cl (= (= (and (not (= tptp.a (- 1))) (not (>= tptp.a 0)) (>= tptp.a (- 1))) false) (not (and (not (= tptp.a (- 1))) (not (>= tptp.a 0)) (>= tptp.a (- 1)))))) :rule equiv_simplify)
% 0.20/0.54 (step t127 (cl (= (and (not (= tptp.a (- 1))) (not (>= tptp.a 0)) (>= tptp.a (- 1))) false) (not (not (and (not (= tptp.a (- 1))) (not (>= tptp.a 0)) (>= tptp.a (- 1)))))) :rule equiv2 :premises (t126))
% 0.20/0.54 (step t128 (cl (not (not (not (and (not (= tptp.a (- 1))) (not (>= tptp.a 0)) (>= tptp.a (- 1)))))) (and (not (= tptp.a (- 1))) (not (>= tptp.a 0)) (>= tptp.a (- 1)))) :rule not_not)
% 0.20/0.54 (step t129 (cl (= (and (not (= tptp.a (- 1))) (not (>= tptp.a 0)) (>= tptp.a (- 1))) false) (and (not (= tptp.a (- 1))) (not (>= tptp.a 0)) (>= tptp.a (- 1)))) :rule resolution :premises (t127 t128))
% 0.20/0.54 (step t130 (cl (=> (and (not (= tptp.a (- 1))) (not (>= tptp.a 0)) (>= tptp.a (- 1))) false) (and (not (= tptp.a (- 1))) (not (>= tptp.a 0)) (>= tptp.a (- 1)))) :rule implies_neg1)
% 0.20/0.54 (anchor :step t131)
% 0.20/0.54 (assume t131.a0 (not (= tptp.a (- 1))))
% 0.20/0.54 (assume t131.a1 (not (>= tptp.a 0)))
% 0.20/0.54 (assume t131.a2 (>= tptp.a (- 1)))
% 0.20/0.54 (step t131.t1 (cl (or (= tptp.a (- 1)) (not (<= tptp.a (- 1))) (not (<= (- 1) tptp.a)))) :rule la_disequality)
% 0.20/0.54 (step t131.t2 (cl (= tptp.a (- 1)) (not (<= tptp.a (- 1))) (not (<= (- 1) tptp.a))) :rule or :premises (t131.t1))
% 0.20/0.54 (step t131.t3 (cl (not (= (>= tptp.a (- 1)) (<= (- 1) tptp.a))) (not (>= tptp.a (- 1))) (<= (- 1) tptp.a)) :rule equiv_pos2)
% 0.20/0.54 (step t131.t4 (cl (= (>= tptp.a (- 1)) (<= (- 1) tptp.a))) :rule comp_simplify)
% 0.20/0.54 (step t131.t5 (cl (<= (- 1) tptp.a)) :rule resolution :premises (t131.t3 t131.t4 t131.a2))
% 0.20/0.54 (step t131.t6 (cl (not (< tptp.a 0)) (<= tptp.a (- 1))) :rule la_generic :args (1 1))
% 0.20/0.54 (step t131.t7 (cl (not (= (not (>= tptp.a 0)) (< tptp.a 0))) (not (not (>= tptp.a 0))) (< tptp.a 0)) :rule equiv_pos2)
% 0.20/0.54 (step t131.t8 (cl (= (< tptp.a 0) (not (>= tptp.a 0)))) :rule all_simplify)
% 0.20/0.54 (step t131.t9 (cl (= (not (>= tptp.a 0)) (< tptp.a 0))) :rule symm :premises (t131.t8))
% 0.20/0.54 (step t131.t10 (cl (< tptp.a 0)) :rule resolution :premises (t131.t7 t131.t9 t131.a1))
% 0.20/0.54 (step t131.t11 (cl (<= tptp.a (- 1))) :rule resolution :premises (t131.t6 t131.t10))
% 0.20/0.54 (step t131.t12 (cl (= tptp.a (- 1))) :rule resolution :premises (t131.t2 t131.t5 t131.t11))
% 0.20/0.54 (step t131.t13 (cl) :rule resolution :premises (t131.t12 t131.a0))
% 0.20/0.54 (step t131 (cl (not (not (= tptp.a (- 1)))) (not (not (>= tptp.a 0))) (not (>= tptp.a (- 1))) false) :rule subproof :discharge (t131.a0 t131.a1 t131.a2))
% 0.20/0.54 (step t132 (cl (not (and (not (= tptp.a (- 1))) (not (>= tptp.a 0)) (>= tptp.a (- 1)))) (not (= tptp.a (- 1)))) :rule and_pos)
% 0.20/0.54 (step t133 (cl (not (and (not (= tptp.a (- 1))) (not (>= tptp.a 0)) (>= tptp.a (- 1)))) (not (>= tptp.a 0))) :rule and_pos)
% 0.20/0.54 (step t134 (cl (not (and (not (= tptp.a (- 1))) (not (>= tptp.a 0)) (>= tptp.a (- 1)))) (>= tptp.a (- 1))) :rule and_pos)
% 0.20/0.54 (step t135 (cl false (not (and (not (= tptp.a (- 1))) (not (>= tptp.a 0)) (>= tptp.a (- 1)))) (not (and (not (= tptp.a (- 1))) (not (>= tptp.a 0)) (>= tptp.a (- 1)))) (not (and (not (= tptp.a (- 1))) (not (>= tptp.a 0)) (>= tptp.a (- 1))))) :rule resolution :premises (t131 t132 t133 t134))
% 0.20/0.54 (step t136 (cl (not (and (not (= tptp.a (- 1))) (not (>= tptp.a 0)) (>= tptp.a (- 1)))) (not (and (not (= tptp.a (- 1))) (not (>= tptp.a 0)) (>= tptp.a (- 1)))) (not (and (not (= tptp.a (- 1))) (not (>= tptp.a 0)) (>= tptp.a (- 1)))) false) :rule reordering :premises (t135))
% 0.20/0.54 (step t137 (cl (not (and (not (= tptp.a (- 1))) (not (>= tptp.a 0)) (>= tptp.a (- 1)))) false) :rule contraction :premises (t136))
% 0.20/0.54 (step t138 (cl (=> (and (not (= tptp.a (- 1))) (not (>= tptp.a 0)) (>= tptp.a (- 1))) false) false) :rule resolution :premises (t130 t137))
% 0.20/0.54 (step t139 (cl (=> (and (not (= tptp.a (- 1))) (not (>= tptp.a 0)) (>= tptp.a (- 1))) false) (not false)) :rule implies_neg2)
% 0.20/0.54 (step t140 (cl (=> (and (not (= tptp.a (- 1))) (not (>= tptp.a 0)) (>= tptp.a (- 1))) false) (=> (and (not (= tptp.a (- 1))) (not (>= tptp.a 0)) (>= tptp.a (- 1))) false)) :rule resolution :premises (t138 t139))
% 0.20/0.54 (step t141 (cl (=> (and (not (= tptp.a (- 1))) (not (>= tptp.a 0)) (>= tptp.a (- 1))) false)) :rule contraction :premises (t140))
% 0.20/0.54 (step t142 (cl (= (=> (and (not (= tptp.a (- 1))) (not (>= tptp.a 0)) (>= tptp.a (- 1))) false) (not (and (not (= tptp.a (- 1))) (not (>= tptp.a 0)) (>= tptp.a (- 1)))))) :rule implies_simplify)
% 0.20/0.54 (step t143 (cl (not (=> (and (not (= tptp.a (- 1))) (not (>= tptp.a 0)) (>= tptp.a (- 1))) false)) (not (and (not (= tptp.a (- 1))) (not (>= tptp.a 0)) (>= tptp.a (- 1))))) :rule equiv1 :premises (t142))
% 0.20/0.54 (step t144 (cl (not (and (not (= tptp.a (- 1))) (not (>= tptp.a 0)) (>= tptp.a (- 1))))) :rule resolution :premises (t141 t143))
% 0.20/0.54 (step t145 (cl (= (and (not (= tptp.a (- 1))) (not (>= tptp.a 0)) (>= tptp.a (- 1))) false)) :rule resolution :premises (t129 t144))
% 0.20/0.54 (step t146 (cl (= (=> (and (>= tptp.a (- 1)) (not (>= tptp.a 0)) (not (= tptp.a (- 1)))) (and (not (= tptp.a (- 1))) (not (>= tptp.a 0)) (>= tptp.a (- 1)))) (=> (and (>= tptp.a (- 1)) (not (>= tptp.a 0)) (not (= tptp.a (- 1)))) false))) :rule cong :premises (t125 t145))
% 0.20/0.54 (step t147 (cl (= (=> (and (>= tptp.a (- 1)) (not (>= tptp.a 0)) (not (= tptp.a (- 1)))) false) (not (and (>= tptp.a (- 1)) (not (>= tptp.a 0)) (not (= tptp.a (- 1))))))) :rule all_simplify)
% 0.20/0.54 (step t148 (cl (= (=> (and (>= tptp.a (- 1)) (not (>= tptp.a 0)) (not (= tptp.a (- 1)))) (and (not (= tptp.a (- 1))) (not (>= tptp.a 0)) (>= tptp.a (- 1)))) (not (and (>= tptp.a (- 1)) (not (>= tptp.a 0)) (not (= tptp.a (- 1))))))) :rule trans :premises (t146 t147))
% 0.20/0.54 (step t149 (cl (=> (and (>= tptp.a (- 1)) (not (>= tptp.a 0)) (not (= tptp.a (- 1)))) (and (not (= tptp.a (- 1))) (not (>= tptp.a 0)) (>= tptp.a (- 1)))) (and (>= tptp.a (- 1)) (not (>= tptp.a 0)) (not (= tptp.a (- 1))))) :rule implies_neg1)
% 0.20/0.54 (anchor :step t150)
% 0.20/0.54 (assume t150.a0 (>= tptp.a (- 1)))
% 0.20/0.54 (assume t150.a1 (not (>= tptp.a 0)))
% 0.20/0.54 (assume t150.a2 (not (= tptp.a (- 1))))
% 0.20/0.54 (step t150.t1 (cl (and (not (= tptp.a (- 1))) (not (>= tptp.a 0)) (>= tptp.a (- 1))) (not (not (= tptp.a (- 1)))) (not (not (>= tptp.a 0))) (not (>= tptp.a (- 1)))) :rule and_neg)
% 0.20/0.54 (step t150.t2 (cl (and (not (= tptp.a (- 1))) (not (>= tptp.a 0)) (>= tptp.a (- 1)))) :rule resolution :premises (t150.t1 t150.a2 t150.a1 t150.a0))
% 0.20/0.54 (step t150 (cl (not (>= tptp.a (- 1))) (not (not (>= tptp.a 0))) (not (not (= tptp.a (- 1)))) (and (not (= tptp.a (- 1))) (not (>= tptp.a 0)) (>= tptp.a (- 1)))) :rule subproof :discharge (t150.a0 t150.a1 t150.a2))
% 0.20/0.54 (step t151 (cl (not (and (>= tptp.a (- 1)) (not (>= tptp.a 0)) (not (= tptp.a (- 1))))) (>= tptp.a (- 1))) :rule and_pos)
% 0.20/0.54 (step t152 (cl (not (and (>= tptp.a (- 1)) (not (>= tptp.a 0)) (not (= tptp.a (- 1))))) (not (>= tptp.a 0))) :rule and_pos)
% 0.20/0.54 (step t153 (cl (not (and (>= tptp.a (- 1)) (not (>= tptp.a 0)) (not (= tptp.a (- 1))))) (not (= tptp.a (- 1)))) :rule and_pos)
% 0.20/0.54 (step t154 (cl (and (not (= tptp.a (- 1))) (not (>= tptp.a 0)) (>= tptp.a (- 1))) (not (and (>= tptp.a (- 1)) (not (>= tptp.a 0)) (not (= tptp.a (- 1))))) (not (and (>= tptp.a (- 1)) (not (>= tptp.a 0)) (not (= tptp.a (- 1))))) (not (and (>= tptp.a (- 1)) (not (>= tptp.a 0)) (not (= tptp.a (- 1)))))) :rule resolution :premises (t150 t151 t152 t153))
% 0.20/0.54 (step t155 (cl (not (and (>= tptp.a (- 1)) (not (>= tptp.a 0)) (not (= tptp.a (- 1))))) (not (and (>= tptp.a (- 1)) (not (>= tptp.a 0)) (not (= tptp.a (- 1))))) (not (and (>= tptp.a (- 1)) (not (>= tptp.a 0)) (not (= tptp.a (- 1))))) (and (not (= tptp.a (- 1))) (not (>= tptp.a 0)) (>= tptp.a (- 1)))) :rule reordering :premises (t154))
% 0.20/0.54 (step t156 (cl (not (and (>= tptp.a (- 1)) (not (>= tptp.a 0)) (not (= tptp.a (- 1))))) (and (not (= tptp.a (- 1))) (not (>= tptp.a 0)) (>= tptp.a (- 1)))) :rule contraction :premises (t155))
% 0.20/0.54 (step t157 (cl (=> (and (>= tptp.a (- 1)) (not (>= tptp.a 0)) (not (= tptp.a (- 1)))) (and (not (= tptp.a (- 1))) (not (>= tptp.a 0)) (>= tptp.a (- 1)))) (and (not (= tptp.a (- 1))) (not (>= tptp.a 0)) (>= tptp.a (- 1)))) :rule resolution :premises (t149 t156))
% 0.20/0.54 (step t158 (cl (=> (and (>= tptp.a (- 1)) (not (>= tptp.a 0)) (not (= tptp.a (- 1)))) (and (not (= tptp.a (- 1))) (not (>= tptp.a 0)) (>= tptp.a (- 1)))) (not (and (not (= tptp.a (- 1))) (not (>= tptp.a 0)) (>= tptp.a (- 1))))) :rule implies_neg2)
% 0.20/0.54 (step t159 (cl (=> (and (>= tptp.a (- 1)) (not (>= tptp.a 0)) (not (= tptp.a (- 1)))) (and (not (= tptp.a (- 1))) (not (>= tptp.a 0)) (>= tptp.a (- 1)))) (=> (and (>= tptp.a (- 1)) (not (>= tptp.a 0)) (not (= tptp.a (- 1)))) (and (not (= tptp.a (- 1))) (not (>= tptp.a 0)) (>= tptp.a (- 1))))) :rule resolution :premises (t157 t158))
% 0.20/0.54 (step t160 (cl (=> (and (>= tptp.a (- 1)) (not (>= tptp.a 0)) (not (= tptp.a (- 1)))) (and (not (= tptp.a (- 1))) (not (>= tptp.a 0)) (>= tptp.a (- 1))))) :rule contraction :premises (t159))
% 0.20/0.54 (step t161 (cl (not (and (>= tptp.a (- 1)) (not (>= tptp.a 0)) (not (= tptp.a (- 1)))))) :rule resolution :premises (t124 t148 t160))
% 0.20/0.54 (step t162 (cl (not (>= tptp.a (- 1))) (not (not (>= tptp.a 0))) (not (not (= tptp.a (- 1))))) :rule not_and :premises (t161))
% 0.20/0.54 (step t163 (cl (or (not (>= tptp.a (- 1))) (not (not (>= tptp.a 0))) (not (not (= tptp.a (- 1))))) (not (not (>= tptp.a (- 1))))) :rule or_neg)
% 0.20/0.54 (step t164 (cl (or (not (>= tptp.a (- 1))) (not (not (>= tptp.a 0))) (not (not (= tptp.a (- 1))))) (not (not (not (>= tptp.a 0))))) :rule or_neg)
% 0.20/0.54 (step t165 (cl (or (not (>= tptp.a (- 1))) (not (not (>= tptp.a 0))) (not (not (= tptp.a (- 1))))) (not (not (not (= tptp.a (- 1)))))) :rule or_neg)
% 0.20/0.54 (step t166 (cl (or (not (>= tptp.a (- 1))) (not (not (>= tptp.a 0))) (not (not (= tptp.a (- 1))))) (or (not (>= tptp.a (- 1))) (not (not (>= tptp.a 0))) (not (not (= tptp.a (- 1))))) (or (not (>= tptp.a (- 1))) (not (not (>= tptp.a 0))) (not (not (= tptp.a (- 1)))))) :rule resolution :premises (t162 t163 t164 t165))
% 0.20/0.54 (step t167 (cl (or (not (>= tptp.a (- 1))) (not (not (>= tptp.a 0))) (not (not (= tptp.a (- 1)))))) :rule contraction :premises (t166))
% 0.20/0.54 (step t168 (cl (or (not (>= tptp.a (- 1))) (>= tptp.a 0) (= tptp.a (- 1)))) :rule resolution :premises (t101 t123 t167))
% 0.20/0.54 (step t169 (cl (not (>= tptp.a (- 1))) (>= tptp.a 0) (= tptp.a (- 1))) :rule or :premises (t168))
% 0.20/0.54 (step t170 (cl (or (not (= tptp.a (- 1))) (= (* tptp.a tptp.a) 1))) :rule hole :args ((or (not (= tptp.a (- 1))) (= (* tptp.a tptp.a) 1)) 3))
% 0.20/0.54 (step t171 (cl (not (= tptp.a (- 1))) (= (* tptp.a tptp.a) 1)) :rule or :premises (t170))
% 0.20/0.54 (step t172 (cl (= (* tptp.a tptp.a) 1) (not (= tptp.a (- 1)))) :rule reordering :premises (t171))
% 0.20/0.54 (step t173 (cl (not (= (=> (and (>= (* tptp.a tptp.a) 4) (= (* tptp.a tptp.a) 1)) (and (= (* tptp.a tptp.a) 1) (>= (* tptp.a tptp.a) 4))) (not (and (>= (* tptp.a tptp.a) 4) (= (* tptp.a tptp.a) 1))))) (not (=> (and (>= (* tptp.a tptp.a) 4) (= (* tptp.a tptp.a) 1)) (and (= (* tptp.a tptp.a) 1) (>= (* tptp.a tptp.a) 4)))) (not (and (>= (* tptp.a tptp.a) 4) (= (* tptp.a tptp.a) 1)))) :rule equiv_pos2)
% 0.20/0.54 (step t174 (cl (= (and (>= (* tptp.a tptp.a) 4) (= (* tptp.a tptp.a) 1)) (and (>= (* tptp.a tptp.a) 4) (= (* tptp.a tptp.a) 1)))) :rule refl)
% 0.20/0.54 (step t175 (cl (= (= (and (= (* tptp.a tptp.a) 1) (>= (* tptp.a tptp.a) 4)) false) (not (and (= (* tptp.a tptp.a) 1) (>= (* tptp.a tptp.a) 4))))) :rule equiv_simplify)
% 0.20/0.54 (step t176 (cl (= (and (= (* tptp.a tptp.a) 1) (>= (* tptp.a tptp.a) 4)) false) (not (not (and (= (* tptp.a tptp.a) 1) (>= (* tptp.a tptp.a) 4))))) :rule equiv2 :premises (t175))
% 0.20/0.54 (step t177 (cl (not (not (not (and (= (* tptp.a tptp.a) 1) (>= (* tptp.a tptp.a) 4))))) (and (= (* tptp.a tptp.a) 1) (>= (* tptp.a tptp.a) 4))) :rule not_not)
% 0.20/0.54 (step t178 (cl (= (and (= (* tptp.a tptp.a) 1) (>= (* tptp.a tptp.a) 4)) false) (and (= (* tptp.a tptp.a) 1) (>= (* tptp.a tptp.a) 4))) :rule resolution :premises (t176 t177))
% 0.20/0.54 (step t179 (cl (=> (and (= (* tptp.a tptp.a) 1) (>= (* tptp.a tptp.a) 4)) false) (and (= (* tptp.a tptp.a) 1) (>= (* tptp.a tptp.a) 4))) :rule implies_neg1)
% 0.20/0.54 (anchor :step t180)
% 0.20/0.54 (assume t180.a0 (= (* tptp.a tptp.a) 1))
% 0.20/0.54 (assume t180.a1 (>= (* tptp.a tptp.a) 4))
% 0.20/0.54 (step t180.t1 (cl (=> (= (* tptp.a tptp.a) 1) false) (= (* tptp.a tptp.a) 1)) :rule implies_neg1)
% 0.20/0.54 (anchor :step t180.t2)
% 0.20/0.54 (assume t180.t2.a0 (= (* tptp.a tptp.a) 1))
% 0.20/0.54 (step t180.t2.t1 (cl (not (= (<= (+ (* 1.0 (* tptp.a tptp.a)) (* (- 1.0) (* tptp.a tptp.a))) (+ (* 1.0 1) (* (- 1.0) 4))) false)) (not (<= (+ (* 1.0 (* tptp.a tptp.a)) (* (- 1.0) (* tptp.a tptp.a))) (+ (* 1.0 1) (* (- 1.0) 4)))) false) :rule equiv_pos2)
% 0.20/0.54 (step t180.t2.t2 (cl (= (* 1.0 (* tptp.a tptp.a)) (to_real (* tptp.a tptp.a)))) :rule all_simplify)
% 0.20/0.54 (step t180.t2.t3 (cl (= (* (- 1.0) (* tptp.a tptp.a)) (to_real (* (- 1) (* tptp.a tptp.a))))) :rule all_simplify)
% 0.20/0.54 (step t180.t2.t4 (cl (= (+ (* 1.0 (* tptp.a tptp.a)) (* (- 1.0) (* tptp.a tptp.a))) (+ (to_real (* tptp.a tptp.a)) (to_real (* (- 1) (* tptp.a tptp.a)))))) :rule cong :premises (t180.t2.t2 t180.t2.t3))
% 0.20/0.54 (step t180.t2.t5 (cl (= (+ (to_real (* tptp.a tptp.a)) (to_real (* (- 1) (* tptp.a tptp.a)))) 0.0)) :rule all_simplify)
% 0.20/0.54 (step t180.t2.t6 (cl (= (+ (* 1.0 (* tptp.a tptp.a)) (* (- 1.0) (* tptp.a tptp.a))) 0.0)) :rule trans :premises (t180.t2.t4 t180.t2.t5))
% 0.20/0.54 (step t180.t2.t7 (cl (= (* 1.0 1) 1.0)) :rule all_simplify)
% 0.20/0.54 (step t180.t2.t8 (cl (= (* (- 1.0) 4) (- 4.0))) :rule all_simplify)
% 0.20/0.54 (step t180.t2.t9 (cl (= (+ (* 1.0 1) (* (- 1.0) 4)) (+ 1.0 (- 4.0)))) :rule cong :premises (t180.t2.t7 t180.t2.t8))
% 0.20/0.54 (step t180.t2.t10 (cl (= (+ 1.0 (- 4.0)) (- 3.0))) :rule all_simplify)
% 0.20/0.54 (step t180.t2.t11 (cl (= (+ (* 1.0 1) (* (- 1.0) 4)) (- 3.0))) :rule trans :premises (t180.t2.t9 t180.t2.t10))
% 0.20/0.54 (step t180.t2.t12 (cl (= (<= (+ (* 1.0 (* tptp.a tptp.a)) (* (- 1.0) (* tptp.a tptp.a))) (+ (* 1.0 1) (* (- 1.0) 4))) (<= 0.0 (- 3.0)))) :rule cong :premises (t180.t2.t6 t180.t2.t11))
% 0.20/0.54 (step t180.t2.t13 (cl (= (<= 0.0 (- 3.0)) false)) :rule all_simplify)
% 0.20/0.54 (step t180.t2.t14 (cl (= (<= (+ (* 1.0 (* tptp.a tptp.a)) (* (- 1.0) (* tptp.a tptp.a))) (+ (* 1.0 1) (* (- 1.0) 4))) false)) :rule trans :premises (t180.t2.t12 t180.t2.t13))
% 0.20/0.54 (step t180.t2.t15 (cl (not (= (* 1.0 (* tptp.a tptp.a)) (* 1.0 1))) (not (<= (* (- 1.0) (* tptp.a tptp.a)) (* (- 1.0) 4))) (<= (+ (* 1.0 (* tptp.a tptp.a)) (* (- 1.0) (* tptp.a tptp.a))) (+ (* 1.0 1) (* (- 1.0) 4)))) :rule la_generic :args ((- 1) 1 1))
% 0.20/0.54 (step t180.t2.t16 (cl (=> (and (> 1.0 0) (= (* tptp.a tptp.a) 1)) (= (* 1.0 (* tptp.a tptp.a)) (* 1.0 1)))) :rule la_mult_pos)
% 0.20/0.54 (step t180.t2.t17 (cl (not (and (> 1.0 0) (= (* tptp.a tptp.a) 1))) (= (* 1.0 (* tptp.a tptp.a)) (* 1.0 1))) :rule implies :premises (t180.t2.t16))
% 0.20/0.54 (step t180.t2.t18 (cl (and (> 1.0 0) (= (* tptp.a tptp.a) 1)) (not (> 1.0 0)) (not (= (* tptp.a tptp.a) 1))) :rule and_neg)
% 0.20/0.54 (step t180.t2.t19 (cl (= (= (> 1.0 0) true) (> 1.0 0))) :rule equiv_simplify)
% 0.20/0.54 (step t180.t2.t20 (cl (not (= (> 1.0 0) true)) (> 1.0 0)) :rule equiv1 :premises (t180.t2.t19))
% 0.20/0.54 (step t180.t2.t21 (cl (= (> 1.0 0) true)) :rule hole :args ((> 1.0 0)))
% 0.20/0.54 (step t180.t2.t22 (cl (> 1.0 0)) :rule resolution :premises (t180.t2.t20 t180.t2.t21))
% 0.20/0.54 (step t180.t2.t23 (cl (and (> 1.0 0) (= (* tptp.a tptp.a) 1))) :rule resolution :premises (t180.t2.t18 t180.t2.t22 t180.t2.a0))
% 0.20/0.54 (step t180.t2.t24 (cl (= (* 1.0 (* tptp.a tptp.a)) (* 1.0 1))) :rule resolution :premises (t180.t2.t17 t180.t2.t23))
% 0.20/0.54 (step t180.t2.t25 (cl (=> (and (< (- 1.0) 0) (>= (* tptp.a tptp.a) 4)) (<= (* (- 1.0) (* tptp.a tptp.a)) (* (- 1.0) 4)))) :rule la_mult_neg)
% 0.20/0.54 (step t180.t2.t26 (cl (not (and (< (- 1.0) 0) (>= (* tptp.a tptp.a) 4))) (<= (* (- 1.0) (* tptp.a tptp.a)) (* (- 1.0) 4))) :rule implies :premises (t180.t2.t25))
% 0.20/0.54 (step t180.t2.t27 (cl (and (< (- 1.0) 0) (>= (* tptp.a tptp.a) 4)) (not (< (- 1.0) 0)) (not (>= (* tptp.a tptp.a) 4))) :rule and_neg)
% 0.20/0.54 (step t180.t2.t28 (cl (= (= (< (- 1.0) 0) true) (< (- 1.0) 0))) :rule equiv_simplify)
% 0.20/0.54 (step t180.t2.t29 (cl (not (= (< (- 1.0) 0) true)) (< (- 1.0) 0)) :rule equiv1 :premises (t180.t2.t28))
% 0.20/0.54 (step t180.t2.t30 (cl (= (< (- 1.0) 0) true)) :rule hole :args ((< (- 1.0) 0)))
% 0.20/0.54 (step t180.t2.t31 (cl (< (- 1.0) 0)) :rule resolution :premises (t180.t2.t29 t180.t2.t30))
% 0.20/0.54 (step t180.t2.t32 (cl (and (< (- 1.0) 0) (>= (* tptp.a tptp.a) 4))) :rule resolution :premises (t180.t2.t27 t180.t2.t31 t180.a1))
% 0.20/0.54 (step t180.t2.t33 (cl (<= (* (- 1.0) (* tptp.a tptp.a)) (* (- 1.0) 4))) :rule resolution :premises (t180.t2.t26 t180.t2.t32))
% 0.20/0.54 (step t180.t2.t34 (cl (<= (+ (* 1.0 (* tptp.a tptp.a)) (* (- 1.0) (* tptp.a tptp.a))) (+ (* 1.0 1) (* (- 1.0) 4)))) :rule resolution :premises (t180.t2.t15 t180.t2.t24 t180.t2.t33))
% 0.20/0.54 (step t180.t2.t35 (cl false) :rule resolution :premises (t180.t2.t1 t180.t2.t14 t180.t2.t34))
% 0.20/0.54 (step t180.t2 (cl (not (= (* tptp.a tptp.a) 1)) false) :rule subproof :discharge (t180.t2.a0))
% 0.20/0.54 (step t180.t3 (cl (=> (= (* tptp.a tptp.a) 1) false) false) :rule resolution :premises (t180.t1 t180.t2))
% 0.20/0.54 (step t180.t4 (cl (=> (= (* tptp.a tptp.a) 1) false) (not false)) :rule implies_neg2)
% 0.20/0.54 (step t180.t5 (cl (=> (= (* tptp.a tptp.a) 1) false) (=> (= (* tptp.a tptp.a) 1) false)) :rule resolution :premises (t180.t3 t180.t4))
% 0.20/0.54 (step t180.t6 (cl (=> (= (* tptp.a tptp.a) 1) false)) :rule contraction :premises (t180.t5))
% 0.20/0.54 (step t180.t7 (cl (= (=> (= (* tptp.a tptp.a) 1) false) (not (= (* tptp.a tptp.a) 1)))) :rule implies_simplify)
% 0.20/0.54 (step t180.t8 (cl (not (=> (= (* tptp.a tptp.a) 1) false)) (not (= (* tptp.a tptp.a) 1))) :rule equiv1 :premises (t180.t7))
% 0.20/0.54 (step t180.t9 (cl (not (= (* tptp.a tptp.a) 1))) :rule resolution :premises (t180.t6 t180.t8))
% 0.20/0.54 (step t180.t10 (cl) :rule resolution :premises (t180.a0 t180.t9))
% 0.20/0.54 (step t180 (cl (not (= (* tptp.a tptp.a) 1)) (not (>= (* tptp.a tptp.a) 4)) false) :rule subproof :discharge (t180.a0 t180.a1))
% 0.20/0.54 (step t181 (cl (not (and (= (* tptp.a tptp.a) 1) (>= (* tptp.a tptp.a) 4))) (= (* tptp.a tptp.a) 1)) :rule and_pos)
% 0.20/0.54 (step t182 (cl (not (and (= (* tptp.a tptp.a) 1) (>= (* tptp.a tptp.a) 4))) (>= (* tptp.a tptp.a) 4)) :rule and_pos)
% 0.20/0.54 (step t183 (cl false (not (and (= (* tptp.a tptp.a) 1) (>= (* tptp.a tptp.a) 4))) (not (and (= (* tptp.a tptp.a) 1) (>= (* tptp.a tptp.a) 4)))) :rule resolution :premises (t180 t181 t182))
% 0.20/0.54 (step t184 (cl (not (and (= (* tptp.a tptp.a) 1) (>= (* tptp.a tptp.a) 4))) (not (and (= (* tptp.a tptp.a) 1) (>= (* tptp.a tptp.a) 4))) false) :rule reordering :premises (t183))
% 0.20/0.54 (step t185 (cl (not (and (= (* tptp.a tptp.a) 1) (>= (* tptp.a tptp.a) 4))) false) :rule contraction :premises (t184))
% 0.20/0.54 (step t186 (cl (=> (and (= (* tptp.a tptp.a) 1) (>= (* tptp.a tptp.a) 4)) false) false) :rule resolution :premises (t179 t185))
% 0.20/0.54 (step t187 (cl (=> (and (= (* tptp.a tptp.a) 1) (>= (* tptp.a tptp.a) 4)) false) (not false)) :rule implies_neg2)
% 0.20/0.54 (step t188 (cl (=> (and (= (* tptp.a tptp.a) 1) (>= (* tptp.a tptp.a) 4)) false) (=> (and (= (* tptp.a tptp.a) 1) (>= (* tptp.a tptp.a) 4)) false)) :rule resolution :premises (t186 t187))
% 0.20/0.54 (step t189 (cl (=> (and (= (* tptp.a tptp.a) 1) (>= (* tptp.a tptp.a) 4)) false)) :rule contraction :premises (t188))
% 0.20/0.54 (step t190 (cl (= (=> (and (= (* tptp.a tptp.a) 1) (>= (* tptp.a tptp.a) 4)) false) (not (and (= (* tptp.a tptp.a) 1) (>= (* tptp.a tptp.a) 4))))) :rule implies_simplify)
% 0.20/0.54 (step t191 (cl (not (=> (and (= (* tptp.a tptp.a) 1) (>= (* tptp.a tptp.a) 4)) false)) (not (and (= (* tptp.a tptp.a) 1) (>= (* tptp.a tptp.a) 4)))) :rule equiv1 :premises (t190))
% 0.20/0.54 (step t192 (cl (not (and (= (* tptp.a tptp.a) 1) (>= (* tptp.a tptp.a) 4)))) :rule resolution :premises (t189 t191))
% 0.20/0.54 (step t193 (cl (= (and (= (* tptp.a tptp.a) 1) (>= (* tptp.a tptp.a) 4)) false)) :rule resolution :premises (t178 t192))
% 0.20/0.54 (step t194 (cl (= (=> (and (>= (* tptp.a tptp.a) 4) (= (* tptp.a tptp.a) 1)) (and (= (* tptp.a tptp.a) 1) (>= (* tptp.a tptp.a) 4))) (=> (and (>= (* tptp.a tptp.a) 4) (= (* tptp.a tptp.a) 1)) false))) :rule cong :premises (t174 t193))
% 0.20/0.54 (step t195 (cl (= (=> (and (>= (* tptp.a tptp.a) 4) (= (* tptp.a tptp.a) 1)) false) (not (and (>= (* tptp.a tptp.a) 4) (= (* tptp.a tptp.a) 1))))) :rule all_simplify)
% 0.20/0.54 (step t196 (cl (= (=> (and (>= (* tptp.a tptp.a) 4) (= (* tptp.a tptp.a) 1)) (and (= (* tptp.a tptp.a) 1) (>= (* tptp.a tptp.a) 4))) (not (and (>= (* tptp.a tptp.a) 4) (= (* tptp.a tptp.a) 1))))) :rule trans :premises (t194 t195))
% 0.20/0.54 (step t197 (cl (=> (and (>= (* tptp.a tptp.a) 4) (= (* tptp.a tptp.a) 1)) (and (= (* tptp.a tptp.a) 1) (>= (* tptp.a tptp.a) 4))) (and (>= (* tptp.a tptp.a) 4) (= (* tptp.a tptp.a) 1))) :rule implies_neg1)
% 0.20/0.54 (anchor :step t198)
% 0.20/0.54 (assume t198.a0 (>= (* tptp.a tptp.a) 4))
% 0.20/0.54 (assume t198.a1 (= (* tptp.a tptp.a) 1))
% 0.20/0.54 (step t198.t1 (cl (and (= (* tptp.a tptp.a) 1) (>= (* tptp.a tptp.a) 4)) (not (= (* tptp.a tptp.a) 1)) (not (>= (* tptp.a tptp.a) 4))) :rule and_neg)
% 0.20/0.54 (step t198.t2 (cl (and (= (* tptp.a tptp.a) 1) (>= (* tptp.a tptp.a) 4))) :rule resolution :premises (t198.t1 t198.a1 t198.a0))
% 0.20/0.54 (step t198 (cl (not (>= (* tptp.a tptp.a) 4)) (not (= (* tptp.a tptp.a) 1)) (and (= (* tptp.a tptp.a) 1) (>= (* tptp.a tptp.a) 4))) :rule subproof :discharge (t198.a0 t198.a1))
% 0.20/0.54 (step t199 (cl (not (and (>= (* tptp.a tptp.a) 4) (= (* tptp.a tptp.a) 1))) (>= (* tptp.a tptp.a) 4)) :rule and_pos)
% 0.20/0.54 (step t200 (cl (not (and (>= (* tptp.a tptp.a) 4) (= (* tptp.a tptp.a) 1))) (= (* tptp.a tptp.a) 1)) :rule and_pos)
% 0.20/0.54 (step t201 (cl (and (= (* tptp.a tptp.a) 1) (>= (* tptp.a tptp.a) 4)) (not (and (>= (* tptp.a tptp.a) 4) (= (* tptp.a tptp.a) 1))) (not (and (>= (* tptp.a tptp.a) 4) (= (* tptp.a tptp.a) 1)))) :rule resolution :premises (t198 t199 t200))
% 0.20/0.54 (step t202 (cl (not (and (>= (* tptp.a tptp.a) 4) (= (* tptp.a tptp.a) 1))) (not (and (>= (* tptp.a tptp.a) 4) (= (* tptp.a tptp.a) 1))) (and (= (* tptp.a tptp.a) 1) (>= (* tptp.a tptp.a) 4))) :rule reordering :premises (t201))
% 0.20/0.54 (step t203 (cl (not (and (>= (* tptp.a tptp.a) 4) (= (* tptp.a tptp.a) 1))) (and (= (* tptp.a tptp.a) 1) (>= (* tptp.a tptp.a) 4))) :rule contraction :premises (t202))
% 0.20/0.54 (step t204 (cl (=> (and (>= (* tptp.a tptp.a) 4) (= (* tptp.a tptp.a) 1)) (and (= (* tptp.a tptp.a) 1) (>= (* tptp.a tptp.a) 4))) (and (= (* tptp.a tptp.a) 1) (>= (* tptp.a tptp.a) 4))) :rule resolution :premises (t197 t203))
% 0.20/0.54 (step t205 (cl (=> (and (>= (* tptp.a tptp.a) 4) (= (* tptp.a tptp.a) 1)) (and (= (* tptp.a tptp.a) 1) (>= (* tptp.a tptp.a) 4))) (not (and (= (* tptp.a tptp.a) 1) (>= (* tptp.a tptp.a) 4)))) :rule implies_neg2)
% 0.20/0.54 (step t206 (cl (=> (and (>= (* tptp.a tptp.a) 4) (= (* tptp.a tptp.a) 1)) (and (= (* tptp.a tptp.a) 1) (>= (* tptp.a tptp.a) 4))) (=> (and (>= (* tptp.a tptp.a) 4) (= (* tptp.a tptp.a) 1)) (and (= (* tptp.a tptp.a) 1) (>= (* tptp.a tptp.a) 4)))) :rule resolution :premises (t204 t205))
% 0.20/0.54 (step t207 (cl (=> (and (>= (* tptp.a tptp.a) 4) (= (* tptp.a tptp.a) 1)) (and (= (* tptp.a tptp.a) 1) (>= (* tptp.a tptp.a) 4)))) :rule contraction :premises (t206))
% 0.20/0.54 (step t208 (cl (not (and (>= (* tptp.a tptp.a) 4) (= (* tptp.a tptp.a) 1)))) :rule resolution :premises (t173 t196 t207))
% 0.20/0.54 (step t209 (cl (not (>= (* tptp.a tptp.a) 4)) (not (= (* tptp.a tptp.a) 1))) :rule not_and :premises (t208))
% 0.20/0.54 (step t210 (cl (not (= (<= 4 (* tptp.a tptp.a)) (>= (* tptp.a tptp.a) 4))) (not (<= 4 (* tptp.a tptp.a))) (>= (* tptp.a tptp.a) 4)) :rule equiv_pos2)
% 0.20/0.54 (step t211 (cl (= 4 4)) :rule refl)
% 0.20/0.54 (step t212 (cl (= (* tptp.a tptp.a) (* tptp.a tptp.a))) :rule all_simplify)
% 0.20/0.54 (step t213 (cl (= (<= 4 (* tptp.a tptp.a)) (<= 4 (* tptp.a tptp.a)))) :rule cong :premises (t211 t212))
% 0.20/0.54 (step t214 (cl (= (<= 4 (* tptp.a tptp.a)) (>= (* tptp.a tptp.a) 4))) :rule all_simplify)
% 0.20/0.54 (step t215 (cl (= (<= 4 (* tptp.a tptp.a)) (>= (* tptp.a tptp.a) 4))) :rule trans :premises (t213 t214))
% 0.20/0.54 (step t216 (cl (>= (* tptp.a tptp.a) 4)) :rule resolution :premises (t210 t215 a0))
% 0.20/0.54 (step t217 (cl (not (= (* tptp.a tptp.a) 1))) :rule resolution :premises (t209 t216))
% 0.20/0.54 (step t218 (cl (not (= tptp.a (- 1)))) :rule resolution :premises (t172 t217))
% 0.20/0.54 (step t219 (cl (not (not (not (>= tptp.a (- 1))))) (>= tptp.a (- 1))) :rule not_not)
% 0.20/0.54 (step t220 (cl (not (not (>= tptp.a (- 1))))) :rule not_or :premises (t99))
% 0.20/0.54 (step t221 (cl (>= tptp.a (- 1))) :rule resolution :premises (t219 t220))
% 0.20/0.54 (step t222 (cl (>= tptp.a 0)) :rule resolution :premises (t169 t218 t221))
% 0.20/0.54 (step t223 (cl (or (not (= tptp.a 1)) (= (* tptp.a tptp.a) 1))) :rule hole :args ((or (not (= tptp.a 1)) (= (* tptp.a tptp.a) 1)) 3))
% 0.20/0.54 (step t224 (cl (not (= tptp.a 1)) (= (* tptp.a tptp.a) 1)) :rule or :premises (t223))
% 0.20/0.54 (step t225 (cl (= (* tptp.a tptp.a) 1) (not (= tptp.a 1))) :rule reordering :premises (t224))
% 0.20/0.54 (step t226 (cl (not (= tptp.a 1))) :rule resolution :premises (t225 t217))
% 0.20/0.54 (step t227 (cl (= tptp.a 0)) :rule resolution :premises (t93 t100 t222 t226))
% 0.20/0.54 (step t228 (cl (= (* tptp.a tptp.a) 0)) :rule resolution :premises (t45 t227))
% 0.20/0.54 (step t229 (cl) :rule resolution :premises (t37 t228 t216))
% 0.20/0.54
% 0.20/0.54 % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.EwgrzYsyUq/cvc5---1.0.5_15708.smt2
% 0.20/0.54 % cvc5---1.0.5 exiting
% 0.20/0.54 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------