TSTP Solution File: ARI699_1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : ARI699_1 : TPTP v8.2.0. Released v6.3.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n023.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:32 EDT 2024
% Result : Unsatisfiable 0.20s 0.51s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : ARI699_1 : TPTP v8.2.0. Released v6.3.0.
% 0.13/0.14 % Command : do_cvc5 %s %d
% 0.14/0.35 % Computer : n023.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon May 27 05:11:09 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.49 %----Proving TF0_ARI
% 0.20/0.50 --- Run --finite-model-find --decision=internal at 15...
% 0.20/0.51 % SZS status Unsatisfiable for /export/starexec/sandbox2/tmp/tmp.A4i8rOYotE/cvc5---1.0.5_5525.smt2
% 0.20/0.51 % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.A4i8rOYotE/cvc5---1.0.5_5525.smt2
% 0.20/0.52 (assume a0 (> tptp.x 0))
% 0.20/0.52 (assume a1 (> tptp.y 0))
% 0.20/0.52 (assume a2 (<= 0 (+ (* (* tptp.z tptp.z) tptp.x) (* (- 1) (* tptp.y tptp.x)))))
% 0.20/0.52 (assume a3 (= (* (* 2 tptp.z) tptp.z) tptp.y))
% 0.20/0.52 (step t1 (cl (not (= (=> (and (>= (* tptp.z tptp.z) 1) (= (* tptp.z tptp.z) 0)) (and (= (* tptp.z tptp.z) 0) (>= (* tptp.z tptp.z) 1))) (not (and (>= (* tptp.z tptp.z) 1) (= (* tptp.z tptp.z) 0))))) (not (=> (and (>= (* tptp.z tptp.z) 1) (= (* tptp.z tptp.z) 0)) (and (= (* tptp.z tptp.z) 0) (>= (* tptp.z tptp.z) 1)))) (not (and (>= (* tptp.z tptp.z) 1) (= (* tptp.z tptp.z) 0)))) :rule equiv_pos2)
% 0.20/0.52 (step t2 (cl (= (and (>= (* tptp.z tptp.z) 1) (= (* tptp.z tptp.z) 0)) (and (>= (* tptp.z tptp.z) 1) (= (* tptp.z tptp.z) 0)))) :rule refl)
% 0.20/0.52 (step t3 (cl (= (= (and (= (* tptp.z tptp.z) 0) (>= (* tptp.z tptp.z) 1)) false) (not (and (= (* tptp.z tptp.z) 0) (>= (* tptp.z tptp.z) 1))))) :rule equiv_simplify)
% 0.20/0.52 (step t4 (cl (= (and (= (* tptp.z tptp.z) 0) (>= (* tptp.z tptp.z) 1)) false) (not (not (and (= (* tptp.z tptp.z) 0) (>= (* tptp.z tptp.z) 1))))) :rule equiv2 :premises (t3))
% 0.20/0.52 (step t5 (cl (not (not (not (and (= (* tptp.z tptp.z) 0) (>= (* tptp.z tptp.z) 1))))) (and (= (* tptp.z tptp.z) 0) (>= (* tptp.z tptp.z) 1))) :rule not_not)
% 0.20/0.52 (step t6 (cl (= (and (= (* tptp.z tptp.z) 0) (>= (* tptp.z tptp.z) 1)) false) (and (= (* tptp.z tptp.z) 0) (>= (* tptp.z tptp.z) 1))) :rule resolution :premises (t4 t5))
% 0.20/0.52 (step t7 (cl (=> (and (= (* tptp.z tptp.z) 0) (>= (* tptp.z tptp.z) 1)) false) (and (= (* tptp.z tptp.z) 0) (>= (* tptp.z tptp.z) 1))) :rule implies_neg1)
% 0.20/0.52 (anchor :step t8)
% 0.20/0.52 (assume t8.a0 (= (* tptp.z tptp.z) 0))
% 0.20/0.52 (assume t8.a1 (>= (* tptp.z tptp.z) 1))
% 0.20/0.52 (step t8.t1 (cl (=> (= (* tptp.z tptp.z) 0) false) (= (* tptp.z tptp.z) 0)) :rule implies_neg1)
% 0.20/0.52 (anchor :step t8.t2)
% 0.20/0.52 (assume t8.t2.a0 (= (* tptp.z tptp.z) 0))
% 0.20/0.52 (step t8.t2.t1 (cl (not (= (<= (+ (* 1.0 (* tptp.z tptp.z)) (* (- 1.0) (* tptp.z tptp.z))) (+ (* 1.0 0) (* (- 1.0) 1))) false)) (not (<= (+ (* 1.0 (* tptp.z tptp.z)) (* (- 1.0) (* tptp.z tptp.z))) (+ (* 1.0 0) (* (- 1.0) 1)))) false) :rule equiv_pos2)
% 0.20/0.52 (step t8.t2.t2 (cl (= (* 1.0 (* tptp.z tptp.z)) (to_real (* tptp.z tptp.z)))) :rule all_simplify)
% 0.20/0.52 (step t8.t2.t3 (cl (= (* (- 1.0) (* tptp.z tptp.z)) (to_real (* (- 1) (* tptp.z tptp.z))))) :rule all_simplify)
% 0.20/0.52 (step t8.t2.t4 (cl (= (+ (* 1.0 (* tptp.z tptp.z)) (* (- 1.0) (* tptp.z tptp.z))) (+ (to_real (* tptp.z tptp.z)) (to_real (* (- 1) (* tptp.z tptp.z)))))) :rule cong :premises (t8.t2.t2 t8.t2.t3))
% 0.20/0.52 (step t8.t2.t5 (cl (= (+ (to_real (* tptp.z tptp.z)) (to_real (* (- 1) (* tptp.z tptp.z)))) 0.0)) :rule all_simplify)
% 0.20/0.52 (step t8.t2.t6 (cl (= (+ (* 1.0 (* tptp.z tptp.z)) (* (- 1.0) (* tptp.z tptp.z))) 0.0)) :rule trans :premises (t8.t2.t4 t8.t2.t5))
% 0.20/0.52 (step t8.t2.t7 (cl (= (* 1.0 0) 0.0)) :rule all_simplify)
% 0.20/0.52 (step t8.t2.t8 (cl (= (* (- 1.0) 1) (- 1.0))) :rule all_simplify)
% 0.20/0.52 (step t8.t2.t9 (cl (= (+ (* 1.0 0) (* (- 1.0) 1)) (+ 0.0 (- 1.0)))) :rule cong :premises (t8.t2.t7 t8.t2.t8))
% 0.20/0.52 (step t8.t2.t10 (cl (= (+ 0.0 (- 1.0)) (- 1.0))) :rule all_simplify)
% 0.20/0.52 (step t8.t2.t11 (cl (= (+ (* 1.0 0) (* (- 1.0) 1)) (- 1.0))) :rule trans :premises (t8.t2.t9 t8.t2.t10))
% 0.20/0.52 (step t8.t2.t12 (cl (= (<= (+ (* 1.0 (* tptp.z tptp.z)) (* (- 1.0) (* tptp.z tptp.z))) (+ (* 1.0 0) (* (- 1.0) 1))) (<= 0.0 (- 1.0)))) :rule cong :premises (t8.t2.t6 t8.t2.t11))
% 0.20/0.52 (step t8.t2.t13 (cl (= (<= 0.0 (- 1.0)) false)) :rule all_simplify)
% 0.20/0.52 (step t8.t2.t14 (cl (= (<= (+ (* 1.0 (* tptp.z tptp.z)) (* (- 1.0) (* tptp.z tptp.z))) (+ (* 1.0 0) (* (- 1.0) 1))) false)) :rule trans :premises (t8.t2.t12 t8.t2.t13))
% 0.20/0.52 (step t8.t2.t15 (cl (not (= (* 1.0 (* tptp.z tptp.z)) (* 1.0 0))) (not (<= (* (- 1.0) (* tptp.z tptp.z)) (* (- 1.0) 1))) (<= (+ (* 1.0 (* tptp.z tptp.z)) (* (- 1.0) (* tptp.z tptp.z))) (+ (* 1.0 0) (* (- 1.0) 1)))) :rule la_generic :args ((- 1) 1 1))
% 0.20/0.52 (step t8.t2.t16 (cl (=> (and (> 1.0 0) (= (* tptp.z tptp.z) 0)) (= (* 1.0 (* tptp.z tptp.z)) (* 1.0 0)))) :rule la_mult_pos)
% 0.20/0.52 (step t8.t2.t17 (cl (not (and (> 1.0 0) (= (* tptp.z tptp.z) 0))) (= (* 1.0 (* tptp.z tptp.z)) (* 1.0 0))) :rule implies :premises (t8.t2.t16))
% 0.20/0.52 (step t8.t2.t18 (cl (and (> 1.0 0) (= (* tptp.z tptp.z) 0)) (not (> 1.0 0)) (not (= (* tptp.z tptp.z) 0))) :rule and_neg)
% 0.20/0.52 (step t8.t2.t19 (cl (= (= (> 1.0 0) true) (> 1.0 0))) :rule equiv_simplify)
% 0.20/0.52 (step t8.t2.t20 (cl (not (= (> 1.0 0) true)) (> 1.0 0)) :rule equiv1 :premises (t8.t2.t19))
% 0.20/0.52 (step t8.t2.t21 (cl (= (> 1.0 0) true)) :rule hole :args ((> 1.0 0)))
% 0.20/0.52 (step t8.t2.t22 (cl (> 1.0 0)) :rule resolution :premises (t8.t2.t20 t8.t2.t21))
% 0.20/0.52 (step t8.t2.t23 (cl (and (> 1.0 0) (= (* tptp.z tptp.z) 0))) :rule resolution :premises (t8.t2.t18 t8.t2.t22 t8.t2.a0))
% 0.20/0.52 (step t8.t2.t24 (cl (= (* 1.0 (* tptp.z tptp.z)) (* 1.0 0))) :rule resolution :premises (t8.t2.t17 t8.t2.t23))
% 0.20/0.52 (step t8.t2.t25 (cl (=> (and (< (- 1.0) 0) (>= (* tptp.z tptp.z) 1)) (<= (* (- 1.0) (* tptp.z tptp.z)) (* (- 1.0) 1)))) :rule la_mult_neg)
% 0.20/0.52 (step t8.t2.t26 (cl (not (and (< (- 1.0) 0) (>= (* tptp.z tptp.z) 1))) (<= (* (- 1.0) (* tptp.z tptp.z)) (* (- 1.0) 1))) :rule implies :premises (t8.t2.t25))
% 0.20/0.52 (step t8.t2.t27 (cl (and (< (- 1.0) 0) (>= (* tptp.z tptp.z) 1)) (not (< (- 1.0) 0)) (not (>= (* tptp.z tptp.z) 1))) :rule and_neg)
% 0.20/0.52 (step t8.t2.t28 (cl (= (= (< (- 1.0) 0) true) (< (- 1.0) 0))) :rule equiv_simplify)
% 0.20/0.52 (step t8.t2.t29 (cl (not (= (< (- 1.0) 0) true)) (< (- 1.0) 0)) :rule equiv1 :premises (t8.t2.t28))
% 0.20/0.52 (step t8.t2.t30 (cl (= (< (- 1.0) 0) true)) :rule hole :args ((< (- 1.0) 0)))
% 0.20/0.52 (step t8.t2.t31 (cl (< (- 1.0) 0)) :rule resolution :premises (t8.t2.t29 t8.t2.t30))
% 0.20/0.52 (step t8.t2.t32 (cl (and (< (- 1.0) 0) (>= (* tptp.z tptp.z) 1))) :rule resolution :premises (t8.t2.t27 t8.t2.t31 t8.a1))
% 0.20/0.52 (step t8.t2.t33 (cl (<= (* (- 1.0) (* tptp.z tptp.z)) (* (- 1.0) 1))) :rule resolution :premises (t8.t2.t26 t8.t2.t32))
% 0.20/0.52 (step t8.t2.t34 (cl (<= (+ (* 1.0 (* tptp.z tptp.z)) (* (- 1.0) (* tptp.z tptp.z))) (+ (* 1.0 0) (* (- 1.0) 1)))) :rule resolution :premises (t8.t2.t15 t8.t2.t24 t8.t2.t33))
% 0.20/0.52 (step t8.t2.t35 (cl false) :rule resolution :premises (t8.t2.t1 t8.t2.t14 t8.t2.t34))
% 0.20/0.52 (step t8.t2 (cl (not (= (* tptp.z tptp.z) 0)) false) :rule subproof :discharge (t8.t2.a0))
% 0.20/0.52 (step t8.t3 (cl (=> (= (* tptp.z tptp.z) 0) false) false) :rule resolution :premises (t8.t1 t8.t2))
% 0.20/0.52 (step t8.t4 (cl (=> (= (* tptp.z tptp.z) 0) false) (not false)) :rule implies_neg2)
% 0.20/0.52 (step t8.t5 (cl (=> (= (* tptp.z tptp.z) 0) false) (=> (= (* tptp.z tptp.z) 0) false)) :rule resolution :premises (t8.t3 t8.t4))
% 0.20/0.52 (step t8.t6 (cl (=> (= (* tptp.z tptp.z) 0) false)) :rule contraction :premises (t8.t5))
% 0.20/0.52 (step t8.t7 (cl (= (=> (= (* tptp.z tptp.z) 0) false) (not (= (* tptp.z tptp.z) 0)))) :rule implies_simplify)
% 0.20/0.52 (step t8.t8 (cl (not (=> (= (* tptp.z tptp.z) 0) false)) (not (= (* tptp.z tptp.z) 0))) :rule equiv1 :premises (t8.t7))
% 0.20/0.52 (step t8.t9 (cl (not (= (* tptp.z tptp.z) 0))) :rule resolution :premises (t8.t6 t8.t8))
% 0.20/0.52 (step t8.t10 (cl) :rule resolution :premises (t8.a0 t8.t9))
% 0.20/0.52 (step t8 (cl (not (= (* tptp.z tptp.z) 0)) (not (>= (* tptp.z tptp.z) 1)) false) :rule subproof :discharge (t8.a0 t8.a1))
% 0.20/0.52 (step t9 (cl (not (and (= (* tptp.z tptp.z) 0) (>= (* tptp.z tptp.z) 1))) (= (* tptp.z tptp.z) 0)) :rule and_pos)
% 0.20/0.52 (step t10 (cl (not (and (= (* tptp.z tptp.z) 0) (>= (* tptp.z tptp.z) 1))) (>= (* tptp.z tptp.z) 1)) :rule and_pos)
% 0.20/0.52 (step t11 (cl false (not (and (= (* tptp.z tptp.z) 0) (>= (* tptp.z tptp.z) 1))) (not (and (= (* tptp.z tptp.z) 0) (>= (* tptp.z tptp.z) 1)))) :rule resolution :premises (t8 t9 t10))
% 0.20/0.52 (step t12 (cl (not (and (= (* tptp.z tptp.z) 0) (>= (* tptp.z tptp.z) 1))) (not (and (= (* tptp.z tptp.z) 0) (>= (* tptp.z tptp.z) 1))) false) :rule reordering :premises (t11))
% 0.20/0.52 (step t13 (cl (not (and (= (* tptp.z tptp.z) 0) (>= (* tptp.z tptp.z) 1))) false) :rule contraction :premises (t12))
% 0.20/0.52 (step t14 (cl (=> (and (= (* tptp.z tptp.z) 0) (>= (* tptp.z tptp.z) 1)) false) false) :rule resolution :premises (t7 t13))
% 0.20/0.52 (step t15 (cl (=> (and (= (* tptp.z tptp.z) 0) (>= (* tptp.z tptp.z) 1)) false) (not false)) :rule implies_neg2)
% 0.20/0.52 (step t16 (cl (=> (and (= (* tptp.z tptp.z) 0) (>= (* tptp.z tptp.z) 1)) false) (=> (and (= (* tptp.z tptp.z) 0) (>= (* tptp.z tptp.z) 1)) false)) :rule resolution :premises (t14 t15))
% 0.20/0.52 (step t17 (cl (=> (and (= (* tptp.z tptp.z) 0) (>= (* tptp.z tptp.z) 1)) false)) :rule contraction :premises (t16))
% 0.20/0.52 (step t18 (cl (= (=> (and (= (* tptp.z tptp.z) 0) (>= (* tptp.z tptp.z) 1)) false) (not (and (= (* tptp.z tptp.z) 0) (>= (* tptp.z tptp.z) 1))))) :rule implies_simplify)
% 0.20/0.52 (step t19 (cl (not (=> (and (= (* tptp.z tptp.z) 0) (>= (* tptp.z tptp.z) 1)) false)) (not (and (= (* tptp.z tptp.z) 0) (>= (* tptp.z tptp.z) 1)))) :rule equiv1 :premises (t18))
% 0.20/0.52 (step t20 (cl (not (and (= (* tptp.z tptp.z) 0) (>= (* tptp.z tptp.z) 1)))) :rule resolution :premises (t17 t19))
% 0.20/0.52 (step t21 (cl (= (and (= (* tptp.z tptp.z) 0) (>= (* tptp.z tptp.z) 1)) false)) :rule resolution :premises (t6 t20))
% 0.20/0.52 (step t22 (cl (= (=> (and (>= (* tptp.z tptp.z) 1) (= (* tptp.z tptp.z) 0)) (and (= (* tptp.z tptp.z) 0) (>= (* tptp.z tptp.z) 1))) (=> (and (>= (* tptp.z tptp.z) 1) (= (* tptp.z tptp.z) 0)) false))) :rule cong :premises (t2 t21))
% 0.20/0.52 (step t23 (cl (= (=> (and (>= (* tptp.z tptp.z) 1) (= (* tptp.z tptp.z) 0)) false) (not (and (>= (* tptp.z tptp.z) 1) (= (* tptp.z tptp.z) 0))))) :rule all_simplify)
% 0.20/0.52 (step t24 (cl (= (=> (and (>= (* tptp.z tptp.z) 1) (= (* tptp.z tptp.z) 0)) (and (= (* tptp.z tptp.z) 0) (>= (* tptp.z tptp.z) 1))) (not (and (>= (* tptp.z tptp.z) 1) (= (* tptp.z tptp.z) 0))))) :rule trans :premises (t22 t23))
% 0.20/0.52 (step t25 (cl (=> (and (>= (* tptp.z tptp.z) 1) (= (* tptp.z tptp.z) 0)) (and (= (* tptp.z tptp.z) 0) (>= (* tptp.z tptp.z) 1))) (and (>= (* tptp.z tptp.z) 1) (= (* tptp.z tptp.z) 0))) :rule implies_neg1)
% 0.20/0.52 (anchor :step t26)
% 0.20/0.52 (assume t26.a0 (>= (* tptp.z tptp.z) 1))
% 0.20/0.52 (assume t26.a1 (= (* tptp.z tptp.z) 0))
% 0.20/0.52 (step t26.t1 (cl (and (= (* tptp.z tptp.z) 0) (>= (* tptp.z tptp.z) 1)) (not (= (* tptp.z tptp.z) 0)) (not (>= (* tptp.z tptp.z) 1))) :rule and_neg)
% 0.20/0.52 (step t26.t2 (cl (and (= (* tptp.z tptp.z) 0) (>= (* tptp.z tptp.z) 1))) :rule resolution :premises (t26.t1 t26.a1 t26.a0))
% 0.20/0.52 (step t26 (cl (not (>= (* tptp.z tptp.z) 1)) (not (= (* tptp.z tptp.z) 0)) (and (= (* tptp.z tptp.z) 0) (>= (* tptp.z tptp.z) 1))) :rule subproof :discharge (t26.a0 t26.a1))
% 0.20/0.52 (step t27 (cl (not (and (>= (* tptp.z tptp.z) 1) (= (* tptp.z tptp.z) 0))) (>= (* tptp.z tptp.z) 1)) :rule and_pos)
% 0.20/0.52 (step t28 (cl (not (and (>= (* tptp.z tptp.z) 1) (= (* tptp.z tptp.z) 0))) (= (* tptp.z tptp.z) 0)) :rule and_pos)
% 0.20/0.52 (step t29 (cl (and (= (* tptp.z tptp.z) 0) (>= (* tptp.z tptp.z) 1)) (not (and (>= (* tptp.z tptp.z) 1) (= (* tptp.z tptp.z) 0))) (not (and (>= (* tptp.z tptp.z) 1) (= (* tptp.z tptp.z) 0)))) :rule resolution :premises (t26 t27 t28))
% 0.20/0.52 (step t30 (cl (not (and (>= (* tptp.z tptp.z) 1) (= (* tptp.z tptp.z) 0))) (not (and (>= (* tptp.z tptp.z) 1) (= (* tptp.z tptp.z) 0))) (and (= (* tptp.z tptp.z) 0) (>= (* tptp.z tptp.z) 1))) :rule reordering :premises (t29))
% 0.20/0.52 (step t31 (cl (not (and (>= (* tptp.z tptp.z) 1) (= (* tptp.z tptp.z) 0))) (and (= (* tptp.z tptp.z) 0) (>= (* tptp.z tptp.z) 1))) :rule contraction :premises (t30))
% 0.20/0.52 (step t32 (cl (=> (and (>= (* tptp.z tptp.z) 1) (= (* tptp.z tptp.z) 0)) (and (= (* tptp.z tptp.z) 0) (>= (* tptp.z tptp.z) 1))) (and (= (* tptp.z tptp.z) 0) (>= (* tptp.z tptp.z) 1))) :rule resolution :premises (t25 t31))
% 0.20/0.52 (step t33 (cl (=> (and (>= (* tptp.z tptp.z) 1) (= (* tptp.z tptp.z) 0)) (and (= (* tptp.z tptp.z) 0) (>= (* tptp.z tptp.z) 1))) (not (and (= (* tptp.z tptp.z) 0) (>= (* tptp.z tptp.z) 1)))) :rule implies_neg2)
% 0.20/0.52 (step t34 (cl (=> (and (>= (* tptp.z tptp.z) 1) (= (* tptp.z tptp.z) 0)) (and (= (* tptp.z tptp.z) 0) (>= (* tptp.z tptp.z) 1))) (=> (and (>= (* tptp.z tptp.z) 1) (= (* tptp.z tptp.z) 0)) (and (= (* tptp.z tptp.z) 0) (>= (* tptp.z tptp.z) 1)))) :rule resolution :premises (t32 t33))
% 0.20/0.52 (step t35 (cl (=> (and (>= (* tptp.z tptp.z) 1) (= (* tptp.z tptp.z) 0)) (and (= (* tptp.z tptp.z) 0) (>= (* tptp.z tptp.z) 1)))) :rule contraction :premises (t34))
% 0.20/0.52 (step t36 (cl (not (and (>= (* tptp.z tptp.z) 1) (= (* tptp.z tptp.z) 0)))) :rule resolution :premises (t1 t24 t35))
% 0.20/0.52 (step t37 (cl (not (>= (* tptp.z tptp.z) 1)) (not (= (* tptp.z tptp.z) 0))) :rule not_and :premises (t36))
% 0.20/0.52 (step t38 (cl (=> (= tptp.z 0) (= (* tptp.z tptp.z) 0)) (= tptp.z 0)) :rule implies_neg1)
% 0.20/0.52 (anchor :step t39)
% 0.20/0.52 (assume t39.a0 (= tptp.z 0))
% 0.20/0.52 (step t39.t1 (cl (= (= (= (* tptp.z tptp.z) 0) true) (= (* tptp.z tptp.z) 0))) :rule equiv_simplify)
% 0.20/0.52 (step t39.t2 (cl (not (= (= (* tptp.z tptp.z) 0) true)) (= (* tptp.z tptp.z) 0)) :rule equiv1 :premises (t39.t1))
% 0.20/0.52 (step t39.t3 (cl (= (* tptp.z tptp.z) (* 0 0))) :rule cong :premises (t39.a0 t39.a0))
% 0.20/0.52 (step t39.t4 (cl (= 0 0)) :rule refl)
% 0.20/0.52 (step t39.t5 (cl (= (= (* tptp.z tptp.z) 0) (= (* 0 0) 0))) :rule cong :premises (t39.t3 t39.t4))
% 0.20/0.52 (step t39.t6 (cl (= (* 0 0) 0)) :rule all_simplify)
% 0.20/0.52 (step t39.t7 (cl (= 0 0)) :rule refl)
% 0.20/0.52 (step t39.t8 (cl (= (= (* 0 0) 0) (= 0 0))) :rule cong :premises (t39.t6 t39.t7))
% 0.20/0.52 (step t39.t9 (cl (= (= 0 0) true)) :rule all_simplify)
% 0.20/0.52 (step t39.t10 (cl (= (= (* 0 0) 0) true)) :rule trans :premises (t39.t8 t39.t9))
% 0.20/0.52 (step t39.t11 (cl (= (= (* tptp.z tptp.z) 0) true)) :rule trans :premises (t39.t5 t39.t10))
% 0.20/0.52 (step t39.t12 (cl (= (* tptp.z tptp.z) 0)) :rule resolution :premises (t39.t2 t39.t11))
% 0.20/0.52 (step t39 (cl (not (= tptp.z 0)) (= (* tptp.z tptp.z) 0)) :rule subproof :discharge (t39.a0))
% 0.20/0.52 (step t40 (cl (=> (= tptp.z 0) (= (* tptp.z tptp.z) 0)) (= (* tptp.z tptp.z) 0)) :rule resolution :premises (t38 t39))
% 0.20/0.52 (step t41 (cl (=> (= tptp.z 0) (= (* tptp.z tptp.z) 0)) (not (= (* tptp.z tptp.z) 0))) :rule implies_neg2)
% 0.20/0.52 (step t42 (cl (=> (= tptp.z 0) (= (* tptp.z tptp.z) 0)) (=> (= tptp.z 0) (= (* tptp.z tptp.z) 0))) :rule resolution :premises (t40 t41))
% 0.20/0.52 (step t43 (cl (=> (= tptp.z 0) (= (* tptp.z tptp.z) 0))) :rule contraction :premises (t42))
% 0.20/0.52 (step t44 (cl (not (= tptp.z 0)) (= (* tptp.z tptp.z) 0)) :rule implies :premises (t43))
% 0.20/0.52 (step t45 (cl (= (* tptp.z tptp.z) 0) (not (= tptp.z 0))) :rule reordering :premises (t44))
% 0.20/0.52 (step t46 (cl (not (= (or (and (not (= tptp.z 0)) (>= tptp.x 1)) (not (not (= tptp.z 0))) (not (>= tptp.x 1))) (or (and (not (= tptp.z 0)) (>= tptp.x 1)) (= tptp.z 0) (not (>= tptp.x 1))))) (not (or (and (not (= tptp.z 0)) (>= tptp.x 1)) (not (not (= tptp.z 0))) (not (>= tptp.x 1)))) (or (and (not (= tptp.z 0)) (>= tptp.x 1)) (= tptp.z 0) (not (>= tptp.x 1)))) :rule equiv_pos2)
% 0.20/0.52 (step t47 (cl (= (and (not (= tptp.z 0)) (>= tptp.x 1)) (and (not (= tptp.z 0)) (>= tptp.x 1)))) :rule refl)
% 0.20/0.52 (step t48 (cl (= (= (= (not (not (= tptp.z 0))) (= tptp.z 0)) true) (= (not (not (= tptp.z 0))) (= tptp.z 0)))) :rule equiv_simplify)
% 0.20/0.52 (step t49 (cl (not (= (= (not (not (= tptp.z 0))) (= tptp.z 0)) true)) (= (not (not (= tptp.z 0))) (= tptp.z 0))) :rule equiv1 :premises (t48))
% 0.20/0.52 (step t50 (cl (= (= (not (not (= tptp.z 0))) (= tptp.z 0)) (= (= tptp.z 0) (not (not (= tptp.z 0)))))) :rule all_simplify)
% 0.20/0.52 (step t51 (cl (= (= tptp.z 0) (= tptp.z 0))) :rule refl)
% 0.20/0.52 (step t52 (cl (= (not (not (= tptp.z 0))) (= tptp.z 0))) :rule all_simplify)
% 0.20/0.52 (step t53 (cl (= (= (= tptp.z 0) (not (not (= tptp.z 0)))) (= (= tptp.z 0) (= tptp.z 0)))) :rule cong :premises (t51 t52))
% 0.20/0.52 (step t54 (cl (= (= (= tptp.z 0) (= tptp.z 0)) true)) :rule all_simplify)
% 0.20/0.52 (step t55 (cl (= (= (= tptp.z 0) (not (not (= tptp.z 0)))) true)) :rule trans :premises (t53 t54))
% 0.20/0.52 (step t56 (cl (= (= (not (not (= tptp.z 0))) (= tptp.z 0)) true)) :rule trans :premises (t50 t55))
% 0.20/0.52 (step t57 (cl (= (not (not (= tptp.z 0))) (= tptp.z 0))) :rule resolution :premises (t49 t56))
% 0.20/0.52 (step t58 (cl (= (not (>= tptp.x 1)) (not (>= tptp.x 1)))) :rule refl)
% 0.20/0.52 (step t59 (cl (= (or (and (not (= tptp.z 0)) (>= tptp.x 1)) (not (not (= tptp.z 0))) (not (>= tptp.x 1))) (or (and (not (= tptp.z 0)) (>= tptp.x 1)) (= tptp.z 0) (not (>= tptp.x 1))))) :rule cong :premises (t47 t57 t58))
% 0.20/0.52 (step t60 (cl (and (not (= tptp.z 0)) (>= tptp.x 1)) (not (not (= tptp.z 0))) (not (>= tptp.x 1))) :rule and_neg)
% 0.20/0.52 (step t61 (cl (or (and (not (= tptp.z 0)) (>= tptp.x 1)) (not (not (= tptp.z 0))) (not (>= tptp.x 1))) (not (and (not (= tptp.z 0)) (>= tptp.x 1)))) :rule or_neg)
% 0.20/0.52 (step t62 (cl (or (and (not (= tptp.z 0)) (>= tptp.x 1)) (not (not (= tptp.z 0))) (not (>= tptp.x 1))) (not (not (not (= tptp.z 0))))) :rule or_neg)
% 0.20/0.52 (step t63 (cl (or (and (not (= tptp.z 0)) (>= tptp.x 1)) (not (not (= tptp.z 0))) (not (>= tptp.x 1))) (not (not (>= tptp.x 1)))) :rule or_neg)
% 0.20/0.52 (step t64 (cl (or (and (not (= tptp.z 0)) (>= tptp.x 1)) (not (not (= tptp.z 0))) (not (>= tptp.x 1))) (or (and (not (= tptp.z 0)) (>= tptp.x 1)) (not (not (= tptp.z 0))) (not (>= tptp.x 1))) (or (and (not (= tptp.z 0)) (>= tptp.x 1)) (not (not (= tptp.z 0))) (not (>= tptp.x 1)))) :rule resolution :premises (t60 t61 t62 t63))
% 0.20/0.52 (step t65 (cl (or (and (not (= tptp.z 0)) (>= tptp.x 1)) (not (not (= tptp.z 0))) (not (>= tptp.x 1)))) :rule contraction :premises (t64))
% 0.20/0.52 (step t66 (cl (or (and (not (= tptp.z 0)) (>= tptp.x 1)) (= tptp.z 0) (not (>= tptp.x 1)))) :rule resolution :premises (t46 t59 t65))
% 0.20/0.52 (step t67 (cl (and (not (= tptp.z 0)) (>= tptp.x 1)) (= tptp.z 0) (not (>= tptp.x 1))) :rule or :premises (t66))
% 0.20/0.52 (step t68 (cl (not (>= tptp.x 1)) (= tptp.z 0) (and (not (= tptp.z 0)) (>= tptp.x 1))) :rule reordering :premises (t67))
% 0.20/0.52 (step t69 (cl (not (= (> tptp.x 0) (>= tptp.x 1))) (not (> tptp.x 0)) (>= tptp.x 1)) :rule equiv_pos2)
% 0.20/0.52 (step t70 (cl (= (> tptp.x 0) (not (<= tptp.x 0)))) :rule all_simplify)
% 0.20/0.52 (step t71 (cl (= (<= tptp.x 0) (not (>= tptp.x 1)))) :rule all_simplify)
% 0.20/0.52 (step t72 (cl (= (not (<= tptp.x 0)) (not (not (>= tptp.x 1))))) :rule cong :premises (t71))
% 0.20/0.52 (step t73 (cl (= (not (not (>= tptp.x 1))) (>= tptp.x 1))) :rule all_simplify)
% 0.20/0.52 (step t74 (cl (= (not (<= tptp.x 0)) (>= tptp.x 1))) :rule trans :premises (t72 t73))
% 0.20/0.52 (step t75 (cl (= (> tptp.x 0) (>= tptp.x 1))) :rule trans :premises (t70 t74))
% 0.20/0.52 (step t76 (cl (>= tptp.x 1)) :rule resolution :premises (t69 t75 a0))
% 0.20/0.52 (step t77 (cl (not (= (=> (and (not (= tptp.z 0)) (> tptp.x 0)) (> (* tptp.z tptp.z tptp.x) 0)) (=> (and (not (= tptp.z 0)) (>= tptp.x 1)) (>= (* tptp.z tptp.z tptp.x) 1)))) (not (=> (and (not (= tptp.z 0)) (> tptp.x 0)) (> (* tptp.z tptp.z tptp.x) 0))) (=> (and (not (= tptp.z 0)) (>= tptp.x 1)) (>= (* tptp.z tptp.z tptp.x) 1))) :rule equiv_pos2)
% 0.20/0.52 (step t78 (cl (= (not (= tptp.z 0)) (not (= tptp.z 0)))) :rule refl)
% 0.20/0.52 (step t79 (cl (= (> tptp.x 0) (>= tptp.x 1))) :rule trans :premises (t70 t74))
% 0.20/0.52 (step t80 (cl (= (and (not (= tptp.z 0)) (> tptp.x 0)) (and (not (= tptp.z 0)) (>= tptp.x 1)))) :rule cong :premises (t78 t79))
% 0.20/0.52 (step t81 (cl (= (> (* tptp.z tptp.z tptp.x) 0) (not (<= (* tptp.z tptp.z tptp.x) 0)))) :rule all_simplify)
% 0.20/0.52 (step t82 (cl (= (<= (* tptp.z tptp.z tptp.x) 0) (not (>= (* tptp.z tptp.z tptp.x) 1)))) :rule all_simplify)
% 0.20/0.52 (step t83 (cl (= (not (<= (* tptp.z tptp.z tptp.x) 0)) (not (not (>= (* tptp.z tptp.z tptp.x) 1))))) :rule cong :premises (t82))
% 0.20/0.52 (step t84 (cl (= (not (not (>= (* tptp.z tptp.z tptp.x) 1))) (>= (* tptp.z tptp.z tptp.x) 1))) :rule all_simplify)
% 0.20/0.52 (step t85 (cl (= (not (<= (* tptp.z tptp.z tptp.x) 0)) (>= (* tptp.z tptp.z tptp.x) 1))) :rule trans :premises (t83 t84))
% 0.20/0.52 (step t86 (cl (= (> (* tptp.z tptp.z tptp.x) 0) (>= (* tptp.z tptp.z tptp.x) 1))) :rule trans :premises (t81 t85))
% 0.20/0.52 (step t87 (cl (= (=> (and (not (= tptp.z 0)) (> tptp.x 0)) (> (* tptp.z tptp.z tptp.x) 0)) (=> (and (not (= tptp.z 0)) (>= tptp.x 1)) (>= (* tptp.z tptp.z tptp.x) 1)))) :rule cong :premises (t80 t86))
% 0.20/0.52 (step t88 (cl (=> (and (not (= tptp.z 0)) (> tptp.x 0)) (> (* tptp.z tptp.z tptp.x) 0))) :rule hole :args ((not (= tptp.z 0)) (> tptp.x 0) (* tptp.z tptp.z tptp.x)))
% 0.20/0.52 (step t89 (cl (=> (and (not (= tptp.z 0)) (>= tptp.x 1)) (>= (* tptp.z tptp.z tptp.x) 1))) :rule resolution :premises (t77 t87 t88))
% 0.20/0.52 (step t90 (cl (not (and (not (= tptp.z 0)) (>= tptp.x 1))) (>= (* tptp.z tptp.z tptp.x) 1)) :rule implies :premises (t89))
% 0.20/0.52 (step t91 (cl (>= (* tptp.z tptp.z tptp.x) 1) (not (and (not (= tptp.z 0)) (>= tptp.x 1)))) :rule reordering :premises (t90))
% 0.20/0.52 (step t92 (cl (not (= (<= 0 (+ (* (* tptp.z tptp.z) tptp.x) (* (- 1) (* tptp.y tptp.x)))) (not (>= (* tptp.z tptp.z tptp.x) 1)))) (not (<= 0 (+ (* (* tptp.z tptp.z) tptp.x) (* (- 1) (* tptp.y tptp.x))))) (not (>= (* tptp.z tptp.z tptp.x) 1))) :rule equiv_pos2)
% 0.20/0.52 (step t93 (cl (= 0 0)) :rule refl)
% 0.20/0.52 (step t94 (cl (= (* tptp.z tptp.z) (* tptp.z tptp.z))) :rule all_simplify)
% 0.20/0.52 (step t95 (cl (= tptp.x tptp.x)) :rule refl)
% 0.20/0.52 (step t96 (cl (= (* (* tptp.z tptp.z) tptp.x) (* (* tptp.z tptp.z) tptp.x))) :rule cong :premises (t94 t95))
% 0.20/0.52 (step t97 (cl (= (* (* tptp.z tptp.z) tptp.x) (* tptp.z tptp.z tptp.x))) :rule all_simplify)
% 0.20/0.52 (step t98 (cl (= (* (* tptp.z tptp.z) tptp.x) (* tptp.z tptp.z tptp.x))) :rule trans :premises (t96 t97))
% 0.20/0.52 (step t99 (cl (= (- 1) (- 1))) :rule refl)
% 0.20/0.52 (step t100 (cl (= (* tptp.y tptp.x) (* tptp.x tptp.y))) :rule all_simplify)
% 0.20/0.52 (step t101 (cl (= (* (- 1) (* tptp.y tptp.x)) (* (- 1) (* tptp.x tptp.y)))) :rule cong :premises (t99 t100))
% 0.20/0.52 (step t102 (cl (= (+ (* (* tptp.z tptp.z) tptp.x) (* (- 1) (* tptp.y tptp.x))) (+ (* tptp.z tptp.z tptp.x) (* (- 1) (* tptp.x tptp.y))))) :rule cong :premises (t98 t101))
% 0.20/0.52 (step t103 (cl (= (+ (* tptp.z tptp.z tptp.x) (* (- 1) (* tptp.x tptp.y))) (+ (* (- 1) (* tptp.x tptp.y)) (* tptp.z tptp.z tptp.x)))) :rule all_simplify)
% 0.20/0.52 (step t104 (cl (= (+ (* (* tptp.z tptp.z) tptp.x) (* (- 1) (* tptp.y tptp.x))) (+ (* (- 1) (* tptp.x tptp.y)) (* tptp.z tptp.z tptp.x)))) :rule trans :premises (t102 t103))
% 0.20/0.52 (step t105 (cl (= (<= 0 (+ (* (* tptp.z tptp.z) tptp.x) (* (- 1) (* tptp.y tptp.x)))) (<= 0 (+ (* (- 1) (* tptp.x tptp.y)) (* tptp.z tptp.z tptp.x))))) :rule cong :premises (t93 t104))
% 0.20/0.52 (step t106 (cl (= (<= 0 (+ (* (- 1) (* tptp.x tptp.y)) (* tptp.z tptp.z tptp.x))) (not (>= (+ (* tptp.x tptp.y) (* (- 1) (* tptp.z tptp.z tptp.x))) 1)))) :rule all_simplify)
% 0.20/0.52 (step t107 (cl (= (<= 0 (+ (* (* tptp.z tptp.z) tptp.x) (* (- 1) (* tptp.y tptp.x)))) (not (>= (+ (* tptp.x tptp.y) (* (- 1) (* tptp.z tptp.z tptp.x))) 1)))) :rule trans :premises (t105 t106))
% 0.20/0.52 (step t108 (cl (= tptp.x tptp.x)) :rule refl)
% 0.20/0.52 (step t109 (cl (not (= (= (* (* 2 tptp.z) tptp.z) tptp.y) (= tptp.y (* 2 (* tptp.z tptp.z))))) (not (= (* (* 2 tptp.z) tptp.z) tptp.y)) (= tptp.y (* 2 (* tptp.z tptp.z)))) :rule equiv_pos2)
% 0.20/0.52 (step t110 (cl (= (* (* 2 tptp.z) tptp.z) (* 2 (* tptp.z tptp.z)))) :rule all_simplify)
% 0.20/0.52 (step t111 (cl (= tptp.y tptp.y)) :rule refl)
% 0.20/0.52 (step t112 (cl (= (= (* (* 2 tptp.z) tptp.z) tptp.y) (= (* 2 (* tptp.z tptp.z)) tptp.y))) :rule cong :premises (t110 t111))
% 0.20/0.52 (step t113 (cl (= (= (* 2 (* tptp.z tptp.z)) tptp.y) (= tptp.y (* 2 (* tptp.z tptp.z))))) :rule all_simplify)
% 0.20/0.52 (step t114 (cl (= (= (* (* 2 tptp.z) tptp.z) tptp.y) (= tptp.y (* 2 (* tptp.z tptp.z))))) :rule trans :premises (t112 t113))
% 0.20/0.52 (step t115 (cl (= tptp.y (* 2 (* tptp.z tptp.z)))) :rule resolution :premises (t109 t114 a3))
% 0.20/0.52 (step t116 (cl (= (* tptp.x tptp.y) (* tptp.x (* 2 (* tptp.z tptp.z))))) :rule cong :premises (t108 t115))
% 0.20/0.52 (step t117 (cl (= (* (- 1) (* tptp.z tptp.z tptp.x)) (* (- 1) (* tptp.z tptp.z tptp.x)))) :rule refl)
% 0.20/0.52 (step t118 (cl (= (+ (* tptp.x tptp.y) (* (- 1) (* tptp.z tptp.z tptp.x))) (+ (* tptp.x (* 2 (* tptp.z tptp.z))) (* (- 1) (* tptp.z tptp.z tptp.x))))) :rule cong :premises (t116 t117))
% 0.20/0.52 (step t119 (cl (= 1 1)) :rule refl)
% 0.20/0.52 (step t120 (cl (= (>= (+ (* tptp.x tptp.y) (* (- 1) (* tptp.z tptp.z tptp.x))) 1) (>= (+ (* tptp.x (* 2 (* tptp.z tptp.z))) (* (- 1) (* tptp.z tptp.z tptp.x))) 1))) :rule cong :premises (t118 t119))
% 0.20/0.52 (step t121 (cl (= (not (>= (+ (* tptp.x tptp.y) (* (- 1) (* tptp.z tptp.z tptp.x))) 1)) (not (>= (+ (* tptp.x (* 2 (* tptp.z tptp.z))) (* (- 1) (* tptp.z tptp.z tptp.x))) 1)))) :rule cong :premises (t120))
% 0.20/0.52 (step t122 (cl (= (* tptp.x (* 2 (* tptp.z tptp.z))) (* 2 (* tptp.z tptp.z tptp.x)))) :rule all_simplify)
% 0.20/0.52 (step t123 (cl (= (* (- 1) (* tptp.z tptp.z tptp.x)) (* (- 1) (* tptp.z tptp.z tptp.x)))) :rule refl)
% 0.20/0.52 (step t124 (cl (= (+ (* tptp.x (* 2 (* tptp.z tptp.z))) (* (- 1) (* tptp.z tptp.z tptp.x))) (+ (* 2 (* tptp.z tptp.z tptp.x)) (* (- 1) (* tptp.z tptp.z tptp.x))))) :rule cong :premises (t122 t123))
% 0.20/0.52 (step t125 (cl (= (+ (* 2 (* tptp.z tptp.z tptp.x)) (* (- 1) (* tptp.z tptp.z tptp.x))) (* tptp.z tptp.z tptp.x))) :rule all_simplify)
% 0.20/0.52 (step t126 (cl (= (+ (* tptp.x (* 2 (* tptp.z tptp.z))) (* (- 1) (* tptp.z tptp.z tptp.x))) (* tptp.z tptp.z tptp.x))) :rule trans :premises (t124 t125))
% 0.20/0.52 (step t127 (cl (= 1 1)) :rule refl)
% 0.20/0.52 (step t128 (cl (= (>= (+ (* tptp.x (* 2 (* tptp.z tptp.z))) (* (- 1) (* tptp.z tptp.z tptp.x))) 1) (>= (* tptp.z tptp.z tptp.x) 1))) :rule cong :premises (t126 t127))
% 0.20/0.52 (step t129 (cl (= (not (>= (+ (* tptp.x (* 2 (* tptp.z tptp.z))) (* (- 1) (* tptp.z tptp.z tptp.x))) 1)) (not (>= (* tptp.z tptp.z tptp.x) 1)))) :rule cong :premises (t128))
% 0.20/0.52 (step t130 (cl (= (not (>= (+ (* tptp.x tptp.y) (* (- 1) (* tptp.z tptp.z tptp.x))) 1)) (not (>= (* tptp.z tptp.z tptp.x) 1)))) :rule trans :premises (t121 t129))
% 0.20/0.52 (step t131 (cl (= (<= 0 (+ (* (* tptp.z tptp.z) tptp.x) (* (- 1) (* tptp.y tptp.x)))) (not (>= (* tptp.z tptp.z tptp.x) 1)))) :rule trans :premises (t107 t130))
% 0.20/0.52 (step t132 (cl (not (>= (* tptp.z tptp.z tptp.x) 1))) :rule resolution :premises (t92 t131 a2))
% 0.20/0.52 (step t133 (cl (not (and (not (= tptp.z 0)) (>= tptp.x 1)))) :rule resolution :premises (t91 t132))
% 0.20/0.52 (step t134 (cl (= tptp.z 0)) :rule resolution :premises (t68 t76 t133))
% 0.20/0.52 (step t135 (cl (= (* tptp.z tptp.z) 0)) :rule resolution :premises (t45 t134))
% 0.20/0.52 (step t136 (cl (not (= (> tptp.y 0) (>= (* tptp.z tptp.z) 1))) (not (> tptp.y 0)) (>= (* tptp.z tptp.z) 1)) :rule equiv_pos2)
% 0.20/0.52 (step t137 (cl (= (> tptp.y 0) (not (<= tptp.y 0)))) :rule all_simplify)
% 0.20/0.52 (step t138 (cl (= (<= tptp.y 0) (not (>= tptp.y 1)))) :rule all_simplify)
% 0.20/0.52 (step t139 (cl (= (not (<= tptp.y 0)) (not (not (>= tptp.y 1))))) :rule cong :premises (t138))
% 0.20/0.52 (step t140 (cl (= (not (not (>= tptp.y 1))) (>= tptp.y 1))) :rule all_simplify)
% 0.20/0.52 (step t141 (cl (= (not (<= tptp.y 0)) (>= tptp.y 1))) :rule trans :premises (t139 t140))
% 0.20/0.52 (step t142 (cl (= (> tptp.y 0) (>= tptp.y 1))) :rule trans :premises (t137 t141))
% 0.20/0.52 (step t143 (cl (not (= (= (* (* 2 tptp.z) tptp.z) tptp.y) (= tptp.y (* 2 (* tptp.z tptp.z))))) (not (= (* (* 2 tptp.z) tptp.z) tptp.y)) (= tptp.y (* 2 (* tptp.z tptp.z)))) :rule equiv_pos2)
% 0.20/0.52 (step t144 (cl (= tptp.y (* 2 (* tptp.z tptp.z)))) :rule resolution :premises (t143 t114 a3))
% 0.20/0.52 (step t145 (cl (= 1 1)) :rule refl)
% 0.20/0.52 (step t146 (cl (= (>= tptp.y 1) (>= (* 2 (* tptp.z tptp.z)) 1))) :rule cong :premises (t144 t145))
% 0.20/0.52 (step t147 (cl (= (>= (* 2 (* tptp.z tptp.z)) 1) (>= (* tptp.z tptp.z) 1))) :rule all_simplify)
% 0.20/0.52 (step t148 (cl (= (>= tptp.y 1) (>= (* tptp.z tptp.z) 1))) :rule trans :premises (t146 t147))
% 0.20/0.52 (step t149 (cl (= (> tptp.y 0) (>= (* tptp.z tptp.z) 1))) :rule trans :premises (t142 t148))
% 0.20/0.52 (step t150 (cl (>= (* tptp.z tptp.z) 1)) :rule resolution :premises (t136 t149 a1))
% 0.20/0.52 (step t151 (cl) :rule resolution :premises (t37 t135 t150))
% 0.20/0.52
% 0.20/0.52 % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.A4i8rOYotE/cvc5---1.0.5_5525.smt2
% 0.20/0.53 % cvc5---1.0.5 exiting
% 0.20/0.53 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------