TSTP Solution File: ARI504_1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : ARI504_1 : TPTP v8.2.0. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n009.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:33:59 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.03/0.13 % Problem : ARI504_1 : TPTP v8.2.0. Released v5.0.0.
% 0.03/0.14 % Command : do_cvc5 %s %d
% 0.13/0.35 % Computer : n009.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:22:54 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.21/0.50 %----Proving TF0_ARI
% 0.21/0.53 --- Run --finite-model-find --decision=internal at 15...
% 0.21/0.53 % SZS status Theorem for /export/starexec/sandbox/tmp/tmp.6ITr4imXGl/cvc5---1.0.5_26829.smt2
% 0.21/0.53 % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.6ITr4imXGl/cvc5---1.0.5_26829.smt2
% 0.21/0.53 (assume a0 (not (exists ((Q Int) (R Int)) (and (not (= R 0)) (= (to_real Q) (* (/ 41 20) (to_real R)))))))
% 0.21/0.53 (assume a1 true)
% 0.21/0.53 (step t1 (cl (not (= (=> (forall ((Q Int) (R Int)) (or (= R 0) (not (= (* 20 Q) (* 41 R))))) (or (= (- 20) 0) (not (= (* 20 (* (- 1) 41)) (* 41 (- 20)))))) (not (forall ((Q Int) (R Int)) (or (= R 0) (not (= (* 20 Q) (* 41 R)))))))) (not (=> (forall ((Q Int) (R Int)) (or (= R 0) (not (= (* 20 Q) (* 41 R))))) (or (= (- 20) 0) (not (= (* 20 (* (- 1) 41)) (* 41 (- 20))))))) (not (forall ((Q Int) (R Int)) (or (= R 0) (not (= (* 20 Q) (* 41 R))))))) :rule equiv_pos2)
% 0.21/0.53 (step t2 (cl (= (forall ((Q Int) (R Int)) (or (= R 0) (not (= (* 20 Q) (* 41 R))))) (forall ((Q Int) (R Int)) (or (= R 0) (not (= (* 20 Q) (* 41 R))))))) :rule refl)
% 0.21/0.53 (step t3 (cl (= (= (- 20) 0) false)) :rule all_simplify)
% 0.21/0.53 (step t4 (cl (= 20 20)) :rule refl)
% 0.21/0.53 (step t5 (cl (= (* (- 1) 41) (- 41))) :rule all_simplify)
% 0.21/0.53 (step t6 (cl (= (* 20 (* (- 1) 41)) (* 20 (- 41)))) :rule cong :premises (t4 t5))
% 0.21/0.53 (step t7 (cl (= (* 20 (- 41)) (- 820))) :rule all_simplify)
% 0.21/0.53 (step t8 (cl (= (* 20 (* (- 1) 41)) (- 820))) :rule trans :premises (t6 t7))
% 0.21/0.53 (step t9 (cl (= (* 41 (- 20)) (- 820))) :rule all_simplify)
% 0.21/0.53 (step t10 (cl (= (= (* 20 (* (- 1) 41)) (* 41 (- 20))) (= (- 820) (- 820)))) :rule cong :premises (t8 t9))
% 0.21/0.53 (step t11 (cl (= (= (- 820) (- 820)) true)) :rule all_simplify)
% 0.21/0.53 (step t12 (cl (= (= (* 20 (* (- 1) 41)) (* 41 (- 20))) true)) :rule trans :premises (t10 t11))
% 0.21/0.53 (step t13 (cl (= (not (= (* 20 (* (- 1) 41)) (* 41 (- 20)))) (not true))) :rule cong :premises (t12))
% 0.21/0.53 (step t14 (cl (= (not true) false)) :rule all_simplify)
% 0.21/0.53 (step t15 (cl (= (not (= (* 20 (* (- 1) 41)) (* 41 (- 20)))) false)) :rule trans :premises (t13 t14))
% 0.21/0.53 (step t16 (cl (= (or (= (- 20) 0) (not (= (* 20 (* (- 1) 41)) (* 41 (- 20))))) (or false false))) :rule cong :premises (t3 t15))
% 0.21/0.53 (step t17 (cl (= (or false false) false)) :rule all_simplify)
% 0.21/0.53 (step t18 (cl (= (or (= (- 20) 0) (not (= (* 20 (* (- 1) 41)) (* 41 (- 20))))) false)) :rule trans :premises (t16 t17))
% 0.21/0.53 (step t19 (cl (= (=> (forall ((Q Int) (R Int)) (or (= R 0) (not (= (* 20 Q) (* 41 R))))) (or (= (- 20) 0) (not (= (* 20 (* (- 1) 41)) (* 41 (- 20)))))) (=> (forall ((Q Int) (R Int)) (or (= R 0) (not (= (* 20 Q) (* 41 R))))) false))) :rule cong :premises (t2 t18))
% 0.21/0.53 (step t20 (cl (= (=> (forall ((Q Int) (R Int)) (or (= R 0) (not (= (* 20 Q) (* 41 R))))) false) (not (forall ((Q Int) (R Int)) (or (= R 0) (not (= (* 20 Q) (* 41 R)))))))) :rule all_simplify)
% 0.21/0.53 (step t21 (cl (= (=> (forall ((Q Int) (R Int)) (or (= R 0) (not (= (* 20 Q) (* 41 R))))) (or (= (- 20) 0) (not (= (* 20 (* (- 1) 41)) (* 41 (- 20)))))) (not (forall ((Q Int) (R Int)) (or (= R 0) (not (= (* 20 Q) (* 41 R)))))))) :rule trans :premises (t19 t20))
% 0.21/0.53 (step t22 (cl (=> (forall ((Q Int) (R Int)) (or (= R 0) (not (= (* 20 Q) (* 41 R))))) (or (= (- 20) 0) (not (= (* 20 (* (- 1) 41)) (* 41 (- 20)))))) (forall ((Q Int) (R Int)) (or (= R 0) (not (= (* 20 Q) (* 41 R)))))) :rule implies_neg1)
% 0.21/0.53 (anchor :step t23)
% 0.21/0.53 (assume t23.a0 (forall ((Q Int) (R Int)) (or (= R 0) (not (= (* 20 Q) (* 41 R))))))
% 0.21/0.53 (step t23.t1 (cl (or (not (forall ((Q Int) (R Int)) (or (= R 0) (not (= (* 20 Q) (* 41 R)))))) (or (= (- 20) 0) (not (= (* 20 (* (- 1) 41)) (* 41 (- 20))))))) :rule forall_inst :args ((:= Q (* (- 1) 41)) (:= R (- 20))))
% 0.21/0.53 (step t23.t2 (cl (not (forall ((Q Int) (R Int)) (or (= R 0) (not (= (* 20 Q) (* 41 R)))))) (or (= (- 20) 0) (not (= (* 20 (* (- 1) 41)) (* 41 (- 20)))))) :rule or :premises (t23.t1))
% 0.21/0.53 (step t23.t3 (cl (or (= (- 20) 0) (not (= (* 20 (* (- 1) 41)) (* 41 (- 20)))))) :rule resolution :premises (t23.t2 t23.a0))
% 0.21/0.53 (step t23 (cl (not (forall ((Q Int) (R Int)) (or (= R 0) (not (= (* 20 Q) (* 41 R)))))) (or (= (- 20) 0) (not (= (* 20 (* (- 1) 41)) (* 41 (- 20)))))) :rule subproof :discharge (t23.a0))
% 0.21/0.53 (step t24 (cl (=> (forall ((Q Int) (R Int)) (or (= R 0) (not (= (* 20 Q) (* 41 R))))) (or (= (- 20) 0) (not (= (* 20 (* (- 1) 41)) (* 41 (- 20)))))) (or (= (- 20) 0) (not (= (* 20 (* (- 1) 41)) (* 41 (- 20)))))) :rule resolution :premises (t22 t23))
% 0.21/0.53 (step t25 (cl (=> (forall ((Q Int) (R Int)) (or (= R 0) (not (= (* 20 Q) (* 41 R))))) (or (= (- 20) 0) (not (= (* 20 (* (- 1) 41)) (* 41 (- 20)))))) (not (or (= (- 20) 0) (not (= (* 20 (* (- 1) 41)) (* 41 (- 20))))))) :rule implies_neg2)
% 0.21/0.53 (step t26 (cl (=> (forall ((Q Int) (R Int)) (or (= R 0) (not (= (* 20 Q) (* 41 R))))) (or (= (- 20) 0) (not (= (* 20 (* (- 1) 41)) (* 41 (- 20)))))) (=> (forall ((Q Int) (R Int)) (or (= R 0) (not (= (* 20 Q) (* 41 R))))) (or (= (- 20) 0) (not (= (* 20 (* (- 1) 41)) (* 41 (- 20))))))) :rule resolution :premises (t24 t25))
% 0.21/0.53 (step t27 (cl (=> (forall ((Q Int) (R Int)) (or (= R 0) (not (= (* 20 Q) (* 41 R))))) (or (= (- 20) 0) (not (= (* 20 (* (- 1) 41)) (* 41 (- 20))))))) :rule contraction :premises (t26))
% 0.21/0.53 (step t28 (cl (not (forall ((Q Int) (R Int)) (or (= R 0) (not (= (* 20 Q) (* 41 R))))))) :rule resolution :premises (t1 t21 t27))
% 0.21/0.53 (step t29 (cl (not (= (not (exists ((Q Int) (R Int)) (and (not (= R 0)) (= (to_real Q) (* (/ 41 20) (to_real R)))))) (forall ((Q Int) (R Int)) (or (= R 0) (not (= (* 20 Q) (* 41 R))))))) (not (not (exists ((Q Int) (R Int)) (and (not (= R 0)) (= (to_real Q) (* (/ 41 20) (to_real R))))))) (forall ((Q Int) (R Int)) (or (= R 0) (not (= (* 20 Q) (* 41 R)))))) :rule equiv_pos2)
% 0.21/0.53 (anchor :step t30 :args ((Q Int) (:= Q Q) (R Int) (:= R R)))
% 0.21/0.53 (step t30.t1 (cl (= Q Q)) :rule refl)
% 0.21/0.53 (step t30.t2 (cl (= R R)) :rule refl)
% 0.21/0.53 (step t30.t3 (cl (= (not (= R 0)) (not (= R 0)))) :rule refl)
% 0.21/0.53 (step t30.t4 (cl (= (to_real Q) (to_real Q))) :rule refl)
% 0.21/0.53 (step t30.t5 (cl (= (* (/ 41 20) (to_real R)) (* (/ 41 20) R))) :rule all_simplify)
% 0.21/0.53 (step t30.t6 (cl (= (= (to_real Q) (* (/ 41 20) (to_real R))) (= (to_real Q) (* (/ 41 20) R)))) :rule cong :premises (t30.t4 t30.t5))
% 0.21/0.53 (step t30.t7 (cl (= (= (to_real Q) (* (/ 41 20) R)) (= (* 20 Q) (* 41 R)))) :rule all_simplify)
% 0.21/0.53 (step t30.t8 (cl (= (= (to_real Q) (* (/ 41 20) (to_real R))) (= (* 20 Q) (* 41 R)))) :rule trans :premises (t30.t6 t30.t7))
% 0.21/0.53 (step t30.t9 (cl (= (and (not (= R 0)) (= (to_real Q) (* (/ 41 20) (to_real R)))) (and (not (= R 0)) (= (* 20 Q) (* 41 R))))) :rule cong :premises (t30.t3 t30.t8))
% 0.21/0.53 (step t30 (cl (= (exists ((Q Int) (R Int)) (and (not (= R 0)) (= (to_real Q) (* (/ 41 20) (to_real R))))) (exists ((Q Int) (R Int)) (and (not (= R 0)) (= (* 20 Q) (* 41 R)))))) :rule bind)
% 0.21/0.53 (step t31 (cl (= (exists ((Q Int) (R Int)) (and (not (= R 0)) (= (* 20 Q) (* 41 R)))) (not (forall ((Q Int) (R Int)) (not (and (not (= R 0)) (= (* 20 Q) (* 41 R)))))))) :rule all_simplify)
% 0.21/0.53 (step t32 (cl (= (forall ((Q Int) (R Int)) (not (and (not (= R 0)) (= (* 20 Q) (* 41 R))))) (forall ((Q Int) (R Int)) (or (= R 0) (not (= (* 20 Q) (* 41 R))))))) :rule all_simplify)
% 0.21/0.53 (step t33 (cl (= (not (forall ((Q Int) (R Int)) (not (and (not (= R 0)) (= (* 20 Q) (* 41 R)))))) (not (forall ((Q Int) (R Int)) (or (= R 0) (not (= (* 20 Q) (* 41 R)))))))) :rule cong :premises (t32))
% 0.21/0.53 (step t34 (cl (= (exists ((Q Int) (R Int)) (and (not (= R 0)) (= (* 20 Q) (* 41 R)))) (not (forall ((Q Int) (R Int)) (or (= R 0) (not (= (* 20 Q) (* 41 R)))))))) :rule trans :premises (t31 t33))
% 0.21/0.53 (step t35 (cl (= (exists ((Q Int) (R Int)) (and (not (= R 0)) (= (to_real Q) (* (/ 41 20) (to_real R))))) (not (forall ((Q Int) (R Int)) (or (= R 0) (not (= (* 20 Q) (* 41 R)))))))) :rule trans :premises (t30 t34))
% 0.21/0.53 (step t36 (cl (= (not (exists ((Q Int) (R Int)) (and (not (= R 0)) (= (to_real Q) (* (/ 41 20) (to_real R)))))) (not (not (forall ((Q Int) (R Int)) (or (= R 0) (not (= (* 20 Q) (* 41 R))))))))) :rule cong :premises (t35))
% 0.21/0.53 (step t37 (cl (= (not (not (forall ((Q Int) (R Int)) (or (= R 0) (not (= (* 20 Q) (* 41 R))))))) (forall ((Q Int) (R Int)) (or (= R 0) (not (= (* 20 Q) (* 41 R))))))) :rule all_simplify)
% 0.21/0.53 (step t38 (cl (= (not (exists ((Q Int) (R Int)) (and (not (= R 0)) (= (to_real Q) (* (/ 41 20) (to_real R)))))) (forall ((Q Int) (R Int)) (or (= R 0) (not (= (* 20 Q) (* 41 R))))))) :rule trans :premises (t36 t37))
% 0.21/0.53 (step t39 (cl (forall ((Q Int) (R Int)) (or (= R 0) (not (= (* 20 Q) (* 41 R)))))) :rule resolution :premises (t29 t38 a0))
% 0.21/0.53 (step t40 (cl) :rule resolution :premises (t28 t39))
% 0.21/0.53
% 0.21/0.53 % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.6ITr4imXGl/cvc5---1.0.5_26829.smt2
% 0.21/0.53 % cvc5---1.0.5 exiting
% 0.21/0.53 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------