TSTP Solution File: ARI524_1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : ARI524_1 : TPTP v8.2.0. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n028.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:02 EDT 2024
% Result : Theorem 0.20s 0.52s
% Output : Proof 0.36s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : ARI524_1 : TPTP v8.2.0. Released v5.0.0.
% 0.07/0.14 % Command : do_cvc5 %s %d
% 0.14/0.35 % Computer : n028.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:47:54 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.49 %----Proving TF0_ARI
% 0.20/0.52 --- Run --finite-model-find --decision=internal at 15...
% 0.20/0.52 % SZS status Theorem for /export/starexec/sandbox2/tmp/tmp.D6YvFazEWP/cvc5---1.0.5_23265.smt2
% 0.20/0.52 % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.D6YvFazEWP/cvc5---1.0.5_23265.smt2
% 0.20/0.52 (assume a0 (not (exists ((Q Int) (R Int)) (and (not (= R 0)) (= (to_real Q) (* (* (/ 5 12) (/ 7 10)) (to_real R)))))))
% 0.20/0.52 (assume a1 true)
% 0.20/0.52 (step t1 (cl (not (= (=> (forall ((Q Int) (R Int)) (or (= R 0) (not (= (* 7 R) (* 24 Q))))) (or (= (- 24) 0) (not (= (* 7 (- 24)) (* 24 (* (- 1) 7)))))) (not (forall ((Q Int) (R Int)) (or (= R 0) (not (= (* 7 R) (* 24 Q)))))))) (not (=> (forall ((Q Int) (R Int)) (or (= R 0) (not (= (* 7 R) (* 24 Q))))) (or (= (- 24) 0) (not (= (* 7 (- 24)) (* 24 (* (- 1) 7))))))) (not (forall ((Q Int) (R Int)) (or (= R 0) (not (= (* 7 R) (* 24 Q))))))) :rule equiv_pos2)
% 0.20/0.52 (step t2 (cl (= (forall ((Q Int) (R Int)) (or (= R 0) (not (= (* 7 R) (* 24 Q))))) (forall ((Q Int) (R Int)) (or (= R 0) (not (= (* 7 R) (* 24 Q))))))) :rule refl)
% 0.20/0.52 (step t3 (cl (= (= (- 24) 0) false)) :rule all_simplify)
% 0.20/0.52 (step t4 (cl (= (* 7 (- 24)) (- 168))) :rule all_simplify)
% 0.20/0.52 (step t5 (cl (= 24 24)) :rule refl)
% 0.20/0.52 (step t6 (cl (= (* (- 1) 7) (- 7))) :rule all_simplify)
% 0.20/0.52 (step t7 (cl (= (* 24 (* (- 1) 7)) (* 24 (- 7)))) :rule cong :premises (t5 t6))
% 0.20/0.52 (step t8 (cl (= (* 24 (- 7)) (- 168))) :rule all_simplify)
% 0.20/0.52 (step t9 (cl (= (* 24 (* (- 1) 7)) (- 168))) :rule trans :premises (t7 t8))
% 0.20/0.52 (step t10 (cl (= (= (* 7 (- 24)) (* 24 (* (- 1) 7))) (= (- 168) (- 168)))) :rule cong :premises (t4 t9))
% 0.20/0.52 (step t11 (cl (= (= (- 168) (- 168)) true)) :rule all_simplify)
% 0.20/0.52 (step t12 (cl (= (= (* 7 (- 24)) (* 24 (* (- 1) 7))) true)) :rule trans :premises (t10 t11))
% 0.20/0.52 (step t13 (cl (= (not (= (* 7 (- 24)) (* 24 (* (- 1) 7)))) (not true))) :rule cong :premises (t12))
% 0.20/0.52 (step t14 (cl (= (not true) false)) :rule all_simplify)
% 0.20/0.52 (step t15 (cl (= (not (= (* 7 (- 24)) (* 24 (* (- 1) 7)))) false)) :rule trans :premises (t13 t14))
% 0.20/0.52 (step t16 (cl (= (or (= (- 24) 0) (not (= (* 7 (- 24)) (* 24 (* (- 1) 7))))) (or false false))) :rule cong :premises (t3 t15))
% 0.20/0.52 (step t17 (cl (= (or false false) false)) :rule all_simplify)
% 0.20/0.52 (step t18 (cl (= (or (= (- 24) 0) (not (= (* 7 (- 24)) (* 24 (* (- 1) 7))))) false)) :rule trans :premises (t16 t17))
% 0.20/0.52 (step t19 (cl (= (=> (forall ((Q Int) (R Int)) (or (= R 0) (not (= (* 7 R) (* 24 Q))))) (or (= (- 24) 0) (not (= (* 7 (- 24)) (* 24 (* (- 1) 7)))))) (=> (forall ((Q Int) (R Int)) (or (= R 0) (not (= (* 7 R) (* 24 Q))))) false))) :rule cong :premises (t2 t18))
% 0.20/0.52 (step t20 (cl (= (=> (forall ((Q Int) (R Int)) (or (= R 0) (not (= (* 7 R) (* 24 Q))))) false) (not (forall ((Q Int) (R Int)) (or (= R 0) (not (= (* 7 R) (* 24 Q)))))))) :rule all_simplify)
% 0.20/0.52 (step t21 (cl (= (=> (forall ((Q Int) (R Int)) (or (= R 0) (not (= (* 7 R) (* 24 Q))))) (or (= (- 24) 0) (not (= (* 7 (- 24)) (* 24 (* (- 1) 7)))))) (not (forall ((Q Int) (R Int)) (or (= R 0) (not (= (* 7 R) (* 24 Q)))))))) :rule trans :premises (t19 t20))
% 0.20/0.52 (step t22 (cl (=> (forall ((Q Int) (R Int)) (or (= R 0) (not (= (* 7 R) (* 24 Q))))) (or (= (- 24) 0) (not (= (* 7 (- 24)) (* 24 (* (- 1) 7)))))) (forall ((Q Int) (R Int)) (or (= R 0) (not (= (* 7 R) (* 24 Q)))))) :rule implies_neg1)
% 0.20/0.52 (anchor :step t23)
% 0.20/0.52 (assume t23.a0 (forall ((Q Int) (R Int)) (or (= R 0) (not (= (* 7 R) (* 24 Q))))))
% 0.20/0.52 (step t23.t1 (cl (or (not (forall ((Q Int) (R Int)) (or (= R 0) (not (= (* 7 R) (* 24 Q)))))) (or (= (- 24) 0) (not (= (* 7 (- 24)) (* 24 (* (- 1) 7))))))) :rule forall_inst :args ((:= Q (* (- 1) 7)) (:= R (- 24))))
% 0.20/0.52 (step t23.t2 (cl (not (forall ((Q Int) (R Int)) (or (= R 0) (not (= (* 7 R) (* 24 Q)))))) (or (= (- 24) 0) (not (= (* 7 (- 24)) (* 24 (* (- 1) 7)))))) :rule or :premises (t23.t1))
% 0.20/0.52 (step t23.t3 (cl (or (= (- 24) 0) (not (= (* 7 (- 24)) (* 24 (* (- 1) 7)))))) :rule resolution :premises (t23.t2 t23.a0))
% 0.20/0.52 (step t23 (cl (not (forall ((Q Int) (R Int)) (or (= R 0) (not (= (* 7 R) (* 24 Q)))))) (or (= (- 24) 0) (not (= (* 7 (- 24)) (* 24 (* (- 1) 7)))))) :rule subproof :discharge (t23.a0))
% 0.20/0.52 (step t24 (cl (=> (forall ((Q Int) (R Int)) (or (= R 0) (not (= (* 7 R) (* 24 Q))))) (or (= (- 24) 0) (not (= (* 7 (- 24)) (* 24 (* (- 1) 7)))))) (or (= (- 24) 0) (not (= (* 7 (- 24)) (* 24 (* (- 1) 7)))))) :rule resolution :premises (t22 t23))
% 0.20/0.52 (step t25 (cl (=> (forall ((Q Int) (R Int)) (or (= R 0) (not (= (* 7 R) (* 24 Q))))) (or (= (- 24) 0) (not (= (* 7 (- 24)) (* 24 (* (- 1) 7)))))) (not (or (= (- 24) 0) (not (= (* 7 (- 24)) (* 24 (* (- 1) 7))))))) :rule implies_neg2)
% 0.20/0.52 (step t26 (cl (=> (forall ((Q Int) (R Int)) (or (= R 0) (not (= (* 7 R) (* 24 Q))))) (or (= (- 24) 0) (not (= (* 7 (- 24)) (* 24 (* (- 1) 7)))))) (=> (forall ((Q Int) (R Int)) (or (= R 0) (not (= (* 7 R) (* 24 Q))))) (or (= (- 24) 0) (not (= (* 7 (- 24)) (* 24 (* (- 1) 7))))))) :rule resolution :premises (t24 t25))
% 0.20/0.52 (step t27 (cl (=> (forall ((Q Int) (R Int)) (or (= R 0) (not (= (* 7 R) (* 24 Q))))) (or (= (- 24) 0) (not (= (* 7 (- 24)) (* 24 (* (- 1) 7))))))) :rule contraction :premises (t26))
% 0.20/0.52 (step t28 (cl (not (forall ((Q Int) (R Int)) (or (= R 0) (not (= (* 7 R) (* 24 Q))))))) :rule resolution :premises (t1 t21 t27))
% 0.20/0.52 (step t29 (cl (not (= (not (exists ((Q Int) (R Int)) (and (not (= R 0)) (= (to_real Q) (* (* (/ 5 12) (/ 7 10)) (to_real R)))))) (forall ((Q Int) (R Int)) (or (= R 0) (not (= (* 7 R) (* 24 Q))))))) (not (not (exists ((Q Int) (R Int)) (and (not (= R 0)) (= (to_real Q) (* (* (/ 5 12) (/ 7 10)) (to_real R))))))) (forall ((Q Int) (R Int)) (or (= R 0) (not (= (* 7 R) (* 24 Q)))))) :rule equiv_pos2)
% 0.20/0.52 (anchor :step t30 :args ((Q Int) (:= Q Q) (R Int) (:= R R)))
% 0.20/0.52 (step t30.t1 (cl (= Q Q)) :rule refl)
% 0.20/0.52 (step t30.t2 (cl (= R R)) :rule refl)
% 0.20/0.52 (step t30.t3 (cl (= (not (= R 0)) (not (= R 0)))) :rule refl)
% 0.20/0.52 (step t30.t4 (cl (= (to_real Q) (to_real Q))) :rule refl)
% 0.20/0.52 (step t30.t5 (cl (= (* (/ 5 12) (/ 7 10)) (/ 7 24))) :rule all_simplify)
% 0.20/0.52 (step t30.t6 (cl (= (to_real R) (to_real R))) :rule refl)
% 0.20/0.52 (step t30.t7 (cl (= (* (* (/ 5 12) (/ 7 10)) (to_real R)) (* (/ 7 24) (to_real R)))) :rule cong :premises (t30.t5 t30.t6))
% 0.20/0.52 (step t30.t8 (cl (= (* (/ 7 24) (to_real R)) (* (/ 7 24) R))) :rule all_simplify)
% 0.20/0.52 (step t30.t9 (cl (= (* (* (/ 5 12) (/ 7 10)) (to_real R)) (* (/ 7 24) R))) :rule trans :premises (t30.t7 t30.t8))
% 0.20/0.52 (step t30.t10 (cl (= (= (to_real Q) (* (* (/ 5 12) (/ 7 10)) (to_real R))) (= (to_real Q) (* (/ 7 24) R)))) :rule cong :premises (t30.t4 t30.t9))
% 0.20/0.52 (step t30.t11 (cl (= (= (to_real Q) (* (/ 7 24) R)) (= (* 7 R) (* 24 Q)))) :rule all_simplify)
% 0.20/0.52 (step t30.t12 (cl (= (= (to_real Q) (* (* (/ 5 12) (/ 7 10)) (to_real R))) (= (* 7 R) (* 24 Q)))) :rule trans :premises (t30.t10 t30.t11))
% 0.20/0.52 (step t30.t13 (cl (= (and (not (= R 0)) (= (to_real Q) (* (* (/ 5 12) (/ 7 10)) (to_real R)))) (and (not (= R 0)) (= (* 7 R) (* 24 Q))))) :rule cong :premises (t30.t3 t30.t12))
% 0.20/0.52 (step t30 (cl (= (exists ((Q Int) (R Int)) (and (not (= R 0)) (= (to_real Q) (* (* (/ 5 12) (/ 7 10)) (to_real R))))) (exists ((Q Int) (R Int)) (and (not (= R 0)) (= (* 7 R) (* 24 Q)))))) :rule bind)
% 0.20/0.52 (step t31 (cl (= (exists ((Q Int) (R Int)) (and (not (= R 0)) (= (* 7 R) (* 24 Q)))) (not (forall ((Q Int) (R Int)) (not (and (not (= R 0)) (= (* 7 R) (* 24 Q)))))))) :rule all_simplify)
% 0.20/0.52 (step t32 (cl (= (forall ((Q Int) (R Int)) (not (and (not (= R 0)) (= (* 7 R) (* 24 Q))))) (forall ((Q Int) (R Int)) (or (= R 0) (not (= (* 7 R) (* 24 Q))))))) :rule all_simplify)
% 0.20/0.52 (step t33 (cl (= (not (forall ((Q Int) (R Int)) (not (and (not (= R 0)) (= (* 7 R) (* 24 Q)))))) (not (forall ((Q Int) (R Int)) (or (= R 0) (not (= (* 7 R) (* 24 Q)))))))) :rule cong :premises (t32))
% 0.20/0.52 (step t34 (cl (= (exists ((Q Int) (R Int)) (and (not (= R 0)) (= (* 7 R) (* 24 Q)))) (not (forall ((Q Int) (R Int)) (or (= R 0) (not (= (* 7 R) (* 24 Q)))))))) :rule trans :premises (t31 t33))
% 0.20/0.52 (step t35 (cl (= (exists ((Q Int) (R Int)) (and (not (= R 0)) (= (to_real Q) (* (* (/ 5 12) (/ 7 10)) (to_real R))))) (not (forall ((Q Int) (R Int)) (or (= R 0) (not (= (* 7 R) (* 24 Q)))))))) :rule trans :premises (t30 t34))
% 0.20/0.52 (step t36 (cl (= (not (exists ((Q Int) (R Int)) (and (not (= R 0)) (= (to_real Q) (* (* (/ 5 12) (/ 7 10)) (to_real R)))))) (not (not (forall ((Q Int) (R Int)) (or (= R 0) (not (= (* 7 R) (* 24 Q))))))))) :rule cong :premises (t35))
% 0.20/0.52 (step t37 (cl (= (not (not (forall ((Q Int) (R Int)) (or (= R 0) (not (= (* 7 R) (* 24 Q))))))) (forall ((Q Int) (R Int)) (or (= R 0) (not (= (* 7 R) (* 24 Q))))))) :rule all_simplify)
% 0.36/0.53 (step t38 (cl (= (not (exists ((Q Int) (R Int)) (and (not (= R 0)) (= (to_real Q) (* (* (/ 5 12) (/ 7 10)) (to_real R)))))) (forall ((Q Int) (R Int)) (or (= R 0) (not (= (* 7 R) (* 24 Q))))))) :rule trans :premises (t36 t37))
% 0.36/0.53 (step t39 (cl (forall ((Q Int) (R Int)) (or (= R 0) (not (= (* 7 R) (* 24 Q)))))) :rule resolution :premises (t29 t38 a0))
% 0.36/0.53 (step t40 (cl) :rule resolution :premises (t28 t39))
% 0.36/0.53
% 0.36/0.53 % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.D6YvFazEWP/cvc5---1.0.5_23265.smt2
% 0.36/0.53 % cvc5---1.0.5 exiting
% 0.36/0.53 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------