TSTP Solution File: ARI535_1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : ARI535_1 : TPTP v8.2.0. Released v5.0.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:03 EDT 2024
% Result : Theorem 0.21s 0.53s
% Output : Proof 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : ARI535_1 : TPTP v8.2.0. Released v5.0.0.
% 0.06/0.14 % Command : do_cvc5 %s %d
% 0.13/0.34 % Computer : n005.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon May 27 05:46:09 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.21/0.49 %----Proving TF0_ARI
% 0.21/0.53 --- Run --finite-model-find --decision=internal at 15...
% 0.21/0.53 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15...
% 0.21/0.53 % SZS status Theorem for /export/starexec/sandbox2/tmp/tmp.ebnMESXJit/cvc5---1.0.5_28226.smt2
% 0.21/0.53 % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.ebnMESXJit/cvc5---1.0.5_28226.smt2
% 0.21/0.53 (assume a0 (not (exists ((X Int) (Y Int)) (=> (tptp.p 2 Y (+ 2 Y)) (tptp.p X 2 (* X 2))))))
% 0.21/0.53 (assume a1 true)
% 0.21/0.53 (step t1 (cl (not (= (=> (forall ((BOUND_VARIABLE_603 Int)) (not (tptp.p BOUND_VARIABLE_603 2 (* 2 BOUND_VARIABLE_603)))) (not (tptp.p 2 2 (* 2 2)))) (=> (forall ((BOUND_VARIABLE_603 Int)) (not (tptp.p BOUND_VARIABLE_603 2 (* 2 BOUND_VARIABLE_603)))) (not (tptp.p 2 2 4))))) (not (=> (forall ((BOUND_VARIABLE_603 Int)) (not (tptp.p BOUND_VARIABLE_603 2 (* 2 BOUND_VARIABLE_603)))) (not (tptp.p 2 2 (* 2 2))))) (=> (forall ((BOUND_VARIABLE_603 Int)) (not (tptp.p BOUND_VARIABLE_603 2 (* 2 BOUND_VARIABLE_603)))) (not (tptp.p 2 2 4)))) :rule equiv_pos2)
% 0.21/0.53 (step t2 (cl (= (forall ((BOUND_VARIABLE_603 Int)) (not (tptp.p BOUND_VARIABLE_603 2 (* 2 BOUND_VARIABLE_603)))) (forall ((BOUND_VARIABLE_603 Int)) (not (tptp.p BOUND_VARIABLE_603 2 (* 2 BOUND_VARIABLE_603)))))) :rule refl)
% 0.21/0.53 (step t3 (cl (= 2 2)) :rule refl)
% 0.21/0.53 (step t4 (cl (= (* 2 2) 4)) :rule all_simplify)
% 0.21/0.53 (step t5 (cl (= (tptp.p 2 2 (* 2 2)) (tptp.p 2 2 4))) :rule cong :premises (t3 t3 t4))
% 0.21/0.53 (step t6 (cl (= (not (tptp.p 2 2 (* 2 2))) (not (tptp.p 2 2 4)))) :rule cong :premises (t5))
% 0.21/0.53 (step t7 (cl (= (=> (forall ((BOUND_VARIABLE_603 Int)) (not (tptp.p BOUND_VARIABLE_603 2 (* 2 BOUND_VARIABLE_603)))) (not (tptp.p 2 2 (* 2 2)))) (=> (forall ((BOUND_VARIABLE_603 Int)) (not (tptp.p BOUND_VARIABLE_603 2 (* 2 BOUND_VARIABLE_603)))) (not (tptp.p 2 2 4))))) :rule cong :premises (t2 t6))
% 0.21/0.53 (step t8 (cl (=> (forall ((BOUND_VARIABLE_603 Int)) (not (tptp.p BOUND_VARIABLE_603 2 (* 2 BOUND_VARIABLE_603)))) (not (tptp.p 2 2 (* 2 2)))) (forall ((BOUND_VARIABLE_603 Int)) (not (tptp.p BOUND_VARIABLE_603 2 (* 2 BOUND_VARIABLE_603))))) :rule implies_neg1)
% 0.21/0.53 (anchor :step t9)
% 0.21/0.53 (assume t9.a0 (forall ((BOUND_VARIABLE_603 Int)) (not (tptp.p BOUND_VARIABLE_603 2 (* 2 BOUND_VARIABLE_603)))))
% 0.21/0.53 (step t9.t1 (cl (or (not (forall ((BOUND_VARIABLE_603 Int)) (not (tptp.p BOUND_VARIABLE_603 2 (* 2 BOUND_VARIABLE_603))))) (not (tptp.p 2 2 (* 2 2))))) :rule forall_inst :args ((:= BOUND_VARIABLE_603 2)))
% 0.21/0.53 (step t9.t2 (cl (not (forall ((BOUND_VARIABLE_603 Int)) (not (tptp.p BOUND_VARIABLE_603 2 (* 2 BOUND_VARIABLE_603))))) (not (tptp.p 2 2 (* 2 2)))) :rule or :premises (t9.t1))
% 0.21/0.53 (step t9.t3 (cl (not (tptp.p 2 2 (* 2 2)))) :rule resolution :premises (t9.t2 t9.a0))
% 0.21/0.53 (step t9 (cl (not (forall ((BOUND_VARIABLE_603 Int)) (not (tptp.p BOUND_VARIABLE_603 2 (* 2 BOUND_VARIABLE_603))))) (not (tptp.p 2 2 (* 2 2)))) :rule subproof :discharge (t9.a0))
% 0.21/0.53 (step t10 (cl (=> (forall ((BOUND_VARIABLE_603 Int)) (not (tptp.p BOUND_VARIABLE_603 2 (* 2 BOUND_VARIABLE_603)))) (not (tptp.p 2 2 (* 2 2)))) (not (tptp.p 2 2 (* 2 2)))) :rule resolution :premises (t8 t9))
% 0.21/0.53 (step t11 (cl (=> (forall ((BOUND_VARIABLE_603 Int)) (not (tptp.p BOUND_VARIABLE_603 2 (* 2 BOUND_VARIABLE_603)))) (not (tptp.p 2 2 (* 2 2)))) (not (not (tptp.p 2 2 (* 2 2))))) :rule implies_neg2)
% 0.21/0.53 (step t12 (cl (=> (forall ((BOUND_VARIABLE_603 Int)) (not (tptp.p BOUND_VARIABLE_603 2 (* 2 BOUND_VARIABLE_603)))) (not (tptp.p 2 2 (* 2 2)))) (=> (forall ((BOUND_VARIABLE_603 Int)) (not (tptp.p BOUND_VARIABLE_603 2 (* 2 BOUND_VARIABLE_603)))) (not (tptp.p 2 2 (* 2 2))))) :rule resolution :premises (t10 t11))
% 0.21/0.53 (step t13 (cl (=> (forall ((BOUND_VARIABLE_603 Int)) (not (tptp.p BOUND_VARIABLE_603 2 (* 2 BOUND_VARIABLE_603)))) (not (tptp.p 2 2 (* 2 2))))) :rule contraction :premises (t12))
% 0.21/0.53 (step t14 (cl (=> (forall ((BOUND_VARIABLE_603 Int)) (not (tptp.p BOUND_VARIABLE_603 2 (* 2 BOUND_VARIABLE_603)))) (not (tptp.p 2 2 4)))) :rule resolution :premises (t1 t7 t13))
% 0.21/0.53 (step t15 (cl (not (forall ((BOUND_VARIABLE_603 Int)) (not (tptp.p BOUND_VARIABLE_603 2 (* 2 BOUND_VARIABLE_603))))) (not (tptp.p 2 2 4))) :rule implies :premises (t14))
% 0.21/0.53 (step t16 (cl (not (= (=> (forall ((BOUND_VARIABLE_597 Int)) (tptp.p 2 BOUND_VARIABLE_597 (+ 2 BOUND_VARIABLE_597))) (tptp.p 2 2 (+ 2 2))) (=> (forall ((BOUND_VARIABLE_597 Int)) (tptp.p 2 BOUND_VARIABLE_597 (+ 2 BOUND_VARIABLE_597))) (tptp.p 2 2 4)))) (not (=> (forall ((BOUND_VARIABLE_597 Int)) (tptp.p 2 BOUND_VARIABLE_597 (+ 2 BOUND_VARIABLE_597))) (tptp.p 2 2 (+ 2 2)))) (=> (forall ((BOUND_VARIABLE_597 Int)) (tptp.p 2 BOUND_VARIABLE_597 (+ 2 BOUND_VARIABLE_597))) (tptp.p 2 2 4))) :rule equiv_pos2)
% 0.21/0.53 (step t17 (cl (= (forall ((BOUND_VARIABLE_597 Int)) (tptp.p 2 BOUND_VARIABLE_597 (+ 2 BOUND_VARIABLE_597))) (forall ((BOUND_VARIABLE_597 Int)) (tptp.p 2 BOUND_VARIABLE_597 (+ 2 BOUND_VARIABLE_597))))) :rule refl)
% 0.21/0.53 (step t18 (cl (= (+ 2 2) 4)) :rule all_simplify)
% 0.21/0.53 (step t19 (cl (= (tptp.p 2 2 (+ 2 2)) (tptp.p 2 2 4))) :rule cong :premises (t3 t3 t18))
% 0.21/0.53 (step t20 (cl (= (=> (forall ((BOUND_VARIABLE_597 Int)) (tptp.p 2 BOUND_VARIABLE_597 (+ 2 BOUND_VARIABLE_597))) (tptp.p 2 2 (+ 2 2))) (=> (forall ((BOUND_VARIABLE_597 Int)) (tptp.p 2 BOUND_VARIABLE_597 (+ 2 BOUND_VARIABLE_597))) (tptp.p 2 2 4)))) :rule cong :premises (t17 t19))
% 0.21/0.53 (step t21 (cl (=> (forall ((BOUND_VARIABLE_597 Int)) (tptp.p 2 BOUND_VARIABLE_597 (+ 2 BOUND_VARIABLE_597))) (tptp.p 2 2 (+ 2 2))) (forall ((BOUND_VARIABLE_597 Int)) (tptp.p 2 BOUND_VARIABLE_597 (+ 2 BOUND_VARIABLE_597)))) :rule implies_neg1)
% 0.21/0.53 (anchor :step t22)
% 0.21/0.53 (assume t22.a0 (forall ((BOUND_VARIABLE_597 Int)) (tptp.p 2 BOUND_VARIABLE_597 (+ 2 BOUND_VARIABLE_597))))
% 0.21/0.53 (step t22.t1 (cl (or (not (forall ((BOUND_VARIABLE_597 Int)) (tptp.p 2 BOUND_VARIABLE_597 (+ 2 BOUND_VARIABLE_597)))) (tptp.p 2 2 (+ 2 2)))) :rule forall_inst :args ((:= BOUND_VARIABLE_597 2)))
% 0.21/0.53 (step t22.t2 (cl (not (forall ((BOUND_VARIABLE_597 Int)) (tptp.p 2 BOUND_VARIABLE_597 (+ 2 BOUND_VARIABLE_597)))) (tptp.p 2 2 (+ 2 2))) :rule or :premises (t22.t1))
% 0.21/0.53 (step t22.t3 (cl (tptp.p 2 2 (+ 2 2))) :rule resolution :premises (t22.t2 t22.a0))
% 0.21/0.53 (step t22 (cl (not (forall ((BOUND_VARIABLE_597 Int)) (tptp.p 2 BOUND_VARIABLE_597 (+ 2 BOUND_VARIABLE_597)))) (tptp.p 2 2 (+ 2 2))) :rule subproof :discharge (t22.a0))
% 0.21/0.53 (step t23 (cl (=> (forall ((BOUND_VARIABLE_597 Int)) (tptp.p 2 BOUND_VARIABLE_597 (+ 2 BOUND_VARIABLE_597))) (tptp.p 2 2 (+ 2 2))) (tptp.p 2 2 (+ 2 2))) :rule resolution :premises (t21 t22))
% 0.21/0.53 (step t24 (cl (=> (forall ((BOUND_VARIABLE_597 Int)) (tptp.p 2 BOUND_VARIABLE_597 (+ 2 BOUND_VARIABLE_597))) (tptp.p 2 2 (+ 2 2))) (not (tptp.p 2 2 (+ 2 2)))) :rule implies_neg2)
% 0.21/0.53 (step t25 (cl (=> (forall ((BOUND_VARIABLE_597 Int)) (tptp.p 2 BOUND_VARIABLE_597 (+ 2 BOUND_VARIABLE_597))) (tptp.p 2 2 (+ 2 2))) (=> (forall ((BOUND_VARIABLE_597 Int)) (tptp.p 2 BOUND_VARIABLE_597 (+ 2 BOUND_VARIABLE_597))) (tptp.p 2 2 (+ 2 2)))) :rule resolution :premises (t23 t24))
% 0.21/0.53 (step t26 (cl (=> (forall ((BOUND_VARIABLE_597 Int)) (tptp.p 2 BOUND_VARIABLE_597 (+ 2 BOUND_VARIABLE_597))) (tptp.p 2 2 (+ 2 2)))) :rule contraction :premises (t25))
% 0.21/0.53 (step t27 (cl (=> (forall ((BOUND_VARIABLE_597 Int)) (tptp.p 2 BOUND_VARIABLE_597 (+ 2 BOUND_VARIABLE_597))) (tptp.p 2 2 4))) :rule resolution :premises (t16 t20 t26))
% 0.21/0.53 (step t28 (cl (not (forall ((BOUND_VARIABLE_597 Int)) (tptp.p 2 BOUND_VARIABLE_597 (+ 2 BOUND_VARIABLE_597)))) (tptp.p 2 2 4)) :rule implies :premises (t27))
% 0.21/0.53 (step t29 (cl (not (= (not (exists ((X Int) (Y Int)) (=> (tptp.p 2 Y (+ 2 Y)) (tptp.p X 2 (* X 2))))) (and (forall ((BOUND_VARIABLE_597 Int)) (tptp.p 2 BOUND_VARIABLE_597 (+ 2 BOUND_VARIABLE_597))) (forall ((BOUND_VARIABLE_603 Int)) (not (tptp.p BOUND_VARIABLE_603 2 (* 2 BOUND_VARIABLE_603))))))) (not (not (exists ((X Int) (Y Int)) (=> (tptp.p 2 Y (+ 2 Y)) (tptp.p X 2 (* X 2)))))) (and (forall ((BOUND_VARIABLE_597 Int)) (tptp.p 2 BOUND_VARIABLE_597 (+ 2 BOUND_VARIABLE_597))) (forall ((BOUND_VARIABLE_603 Int)) (not (tptp.p BOUND_VARIABLE_603 2 (* 2 BOUND_VARIABLE_603)))))) :rule equiv_pos2)
% 0.21/0.53 (anchor :step t30 :args ((X Int) (:= X X) (Y Int) (:= Y Y)))
% 0.21/0.53 (step t30.t1 (cl (= X X)) :rule refl)
% 0.21/0.53 (step t30.t2 (cl (= Y Y)) :rule refl)
% 0.21/0.53 (step t30.t3 (cl (= (tptp.p 2 Y (+ 2 Y)) (tptp.p 2 Y (+ 2 Y)))) :rule refl)
% 0.21/0.53 (step t30.t4 (cl (= X X)) :rule refl)
% 0.21/0.53 (step t30.t5 (cl (= (* X 2) (* 2 X))) :rule all_simplify)
% 0.21/0.53 (step t30.t6 (cl (= (tptp.p X 2 (* X 2)) (tptp.p X 2 (* 2 X)))) :rule cong :premises (t30.t4 t3 t30.t5))
% 0.21/0.53 (step t30.t7 (cl (= (=> (tptp.p 2 Y (+ 2 Y)) (tptp.p X 2 (* X 2))) (=> (tptp.p 2 Y (+ 2 Y)) (tptp.p X 2 (* 2 X))))) :rule cong :premises (t30.t3 t30.t6))
% 0.21/0.53 (step t30 (cl (= (exists ((X Int) (Y Int)) (=> (tptp.p 2 Y (+ 2 Y)) (tptp.p X 2 (* X 2)))) (exists ((X Int) (Y Int)) (=> (tptp.p 2 Y (+ 2 Y)) (tptp.p X 2 (* 2 X)))))) :rule bind)
% 0.21/0.53 (step t31 (cl (= (exists ((X Int) (Y Int)) (=> (tptp.p 2 Y (+ 2 Y)) (tptp.p X 2 (* 2 X)))) (not (forall ((X Int) (Y Int)) (not (=> (tptp.p 2 Y (+ 2 Y)) (tptp.p X 2 (* 2 X)))))))) :rule all_simplify)
% 0.21/0.53 (step t32 (cl (= (forall ((X Int) (Y Int)) (not (=> (tptp.p 2 Y (+ 2 Y)) (tptp.p X 2 (* 2 X))))) (forall ((X Int) (Y Int)) (and (tptp.p 2 Y (+ 2 Y)) (not (tptp.p X 2 (* 2 X))))))) :rule all_simplify)
% 0.21/0.53 (step t33 (cl (= (forall ((X Int) (Y Int)) (and (tptp.p 2 Y (+ 2 Y)) (not (tptp.p X 2 (* 2 X))))) (and (forall ((BOUND_VARIABLE_595 Int) (BOUND_VARIABLE_597 Int)) (tptp.p 2 BOUND_VARIABLE_597 (+ 2 BOUND_VARIABLE_597))) (forall ((BOUND_VARIABLE_603 Int) (BOUND_VARIABLE_605 Int)) (not (tptp.p BOUND_VARIABLE_603 2 (* 2 BOUND_VARIABLE_603))))))) :rule all_simplify)
% 0.21/0.53 (step t34 (cl (= (forall ((BOUND_VARIABLE_595 Int) (BOUND_VARIABLE_597 Int)) (tptp.p 2 BOUND_VARIABLE_597 (+ 2 BOUND_VARIABLE_597))) (forall ((BOUND_VARIABLE_597 Int)) (tptp.p 2 BOUND_VARIABLE_597 (+ 2 BOUND_VARIABLE_597))))) :rule all_simplify)
% 0.21/0.53 (step t35 (cl (= (forall ((BOUND_VARIABLE_603 Int) (BOUND_VARIABLE_605 Int)) (not (tptp.p BOUND_VARIABLE_603 2 (* 2 BOUND_VARIABLE_603)))) (forall ((BOUND_VARIABLE_603 Int)) (not (tptp.p BOUND_VARIABLE_603 2 (* 2 BOUND_VARIABLE_603)))))) :rule all_simplify)
% 0.21/0.53 (step t36 (cl (= (and (forall ((BOUND_VARIABLE_595 Int) (BOUND_VARIABLE_597 Int)) (tptp.p 2 BOUND_VARIABLE_597 (+ 2 BOUND_VARIABLE_597))) (forall ((BOUND_VARIABLE_603 Int) (BOUND_VARIABLE_605 Int)) (not (tptp.p BOUND_VARIABLE_603 2 (* 2 BOUND_VARIABLE_603))))) (and (forall ((BOUND_VARIABLE_597 Int)) (tptp.p 2 BOUND_VARIABLE_597 (+ 2 BOUND_VARIABLE_597))) (forall ((BOUND_VARIABLE_603 Int)) (not (tptp.p BOUND_VARIABLE_603 2 (* 2 BOUND_VARIABLE_603))))))) :rule cong :premises (t34 t35))
% 0.21/0.53 (step t37 (cl (= (forall ((X Int) (Y Int)) (and (tptp.p 2 Y (+ 2 Y)) (not (tptp.p X 2 (* 2 X))))) (and (forall ((BOUND_VARIABLE_597 Int)) (tptp.p 2 BOUND_VARIABLE_597 (+ 2 BOUND_VARIABLE_597))) (forall ((BOUND_VARIABLE_603 Int)) (not (tptp.p BOUND_VARIABLE_603 2 (* 2 BOUND_VARIABLE_603))))))) :rule trans :premises (t33 t36))
% 0.21/0.53 (step t38 (cl (= (forall ((X Int) (Y Int)) (not (=> (tptp.p 2 Y (+ 2 Y)) (tptp.p X 2 (* 2 X))))) (and (forall ((BOUND_VARIABLE_597 Int)) (tptp.p 2 BOUND_VARIABLE_597 (+ 2 BOUND_VARIABLE_597))) (forall ((BOUND_VARIABLE_603 Int)) (not (tptp.p BOUND_VARIABLE_603 2 (* 2 BOUND_VARIABLE_603))))))) :rule trans :premises (t32 t37))
% 0.21/0.53 (step t39 (cl (= (not (forall ((X Int) (Y Int)) (not (=> (tptp.p 2 Y (+ 2 Y)) (tptp.p X 2 (* 2 X)))))) (not (and (forall ((BOUND_VARIABLE_597 Int)) (tptp.p 2 BOUND_VARIABLE_597 (+ 2 BOUND_VARIABLE_597))) (forall ((BOUND_VARIABLE_603 Int)) (not (tptp.p BOUND_VARIABLE_603 2 (* 2 BOUND_VARIABLE_603)))))))) :rule cong :premises (t38))
% 0.21/0.53 (step t40 (cl (= (exists ((X Int) (Y Int)) (=> (tptp.p 2 Y (+ 2 Y)) (tptp.p X 2 (* 2 X)))) (not (and (forall ((BOUND_VARIABLE_597 Int)) (tptp.p 2 BOUND_VARIABLE_597 (+ 2 BOUND_VARIABLE_597))) (forall ((BOUND_VARIABLE_603 Int)) (not (tptp.p BOUND_VARIABLE_603 2 (* 2 BOUND_VARIABLE_603)))))))) :rule trans :premises (t31 t39))
% 0.21/0.53 (step t41 (cl (= (exists ((X Int) (Y Int)) (=> (tptp.p 2 Y (+ 2 Y)) (tptp.p X 2 (* X 2)))) (not (and (forall ((BOUND_VARIABLE_597 Int)) (tptp.p 2 BOUND_VARIABLE_597 (+ 2 BOUND_VARIABLE_597))) (forall ((BOUND_VARIABLE_603 Int)) (not (tptp.p BOUND_VARIABLE_603 2 (* 2 BOUND_VARIABLE_603)))))))) :rule trans :premises (t30 t40))
% 0.21/0.53 (step t42 (cl (= (not (exists ((X Int) (Y Int)) (=> (tptp.p 2 Y (+ 2 Y)) (tptp.p X 2 (* X 2))))) (not (not (and (forall ((BOUND_VARIABLE_597 Int)) (tptp.p 2 BOUND_VARIABLE_597 (+ 2 BOUND_VARIABLE_597))) (forall ((BOUND_VARIABLE_603 Int)) (not (tptp.p BOUND_VARIABLE_603 2 (* 2 BOUND_VARIABLE_603))))))))) :rule cong :premises (t41))
% 0.21/0.53 (step t43 (cl (= (not (not (and (forall ((BOUND_VARIABLE_597 Int)) (tptp.p 2 BOUND_VARIABLE_597 (+ 2 BOUND_VARIABLE_597))) (forall ((BOUND_VARIABLE_603 Int)) (not (tptp.p BOUND_VARIABLE_603 2 (* 2 BOUND_VARIABLE_603))))))) (and (forall ((BOUND_VARIABLE_597 Int)) (tptp.p 2 BOUND_VARIABLE_597 (+ 2 BOUND_VARIABLE_597))) (forall ((BOUND_VARIABLE_603 Int)) (not (tptp.p BOUND_VARIABLE_603 2 (* 2 BOUND_VARIABLE_603))))))) :rule all_simplify)
% 0.21/0.53 (step t44 (cl (= (not (exists ((X Int) (Y Int)) (=> (tptp.p 2 Y (+ 2 Y)) (tptp.p X 2 (* X 2))))) (and (forall ((BOUND_VARIABLE_597 Int)) (tptp.p 2 BOUND_VARIABLE_597 (+ 2 BOUND_VARIABLE_597))) (forall ((BOUND_VARIABLE_603 Int)) (not (tptp.p BOUND_VARIABLE_603 2 (* 2 BOUND_VARIABLE_603))))))) :rule trans :premises (t42 t43))
% 0.21/0.53 (step t45 (cl (and (forall ((BOUND_VARIABLE_597 Int)) (tptp.p 2 BOUND_VARIABLE_597 (+ 2 BOUND_VARIABLE_597))) (forall ((BOUND_VARIABLE_603 Int)) (not (tptp.p BOUND_VARIABLE_603 2 (* 2 BOUND_VARIABLE_603)))))) :rule resolution :premises (t29 t44 a0))
% 0.21/0.53 (step t46 (cl (forall ((BOUND_VARIABLE_597 Int)) (tptp.p 2 BOUND_VARIABLE_597 (+ 2 BOUND_VARIABLE_597)))) :rule and :premises (t45))
% 0.21/0.53 (step t47 (cl (tptp.p 2 2 4)) :rule resolution :premises (t28 t46))
% 0.21/0.53 (step t48 (cl (forall ((BOUND_VARIABLE_603 Int)) (not (tptp.p BOUND_VARIABLE_603 2 (* 2 BOUND_VARIABLE_603))))) :rule and :premises (t45))
% 0.21/0.53 (step t49 (cl) :rule resolution :premises (t15 t47 t48))
% 0.21/0.53
% 0.21/0.53 % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.ebnMESXJit/cvc5---1.0.5_28226.smt2
% 0.21/0.53 % cvc5---1.0.5 exiting
% 0.21/0.53 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------