TSTP Solution File: ARI118_1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : ARI118_1 : TPTP v8.2.0. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n003.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:14 EDT 2024
% Result : Theorem 0.20s 0.52s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : ARI118_1 : TPTP v8.2.0. Released v5.0.0.
% 0.07/0.14 % Command : do_cvc5 %s %d
% 0.14/0.35 % Computer : n003.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:44:09 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.lxIAzjdyNa/cvc5---1.0.5_29328.smt2
% 0.20/0.52 % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.lxIAzjdyNa/cvc5---1.0.5_29328.smt2
% 0.20/0.52 (assume a0 (not (exists ((X Int) (Y Int)) (= (* X Y) X))))
% 0.20/0.52 (assume a1 true)
% 0.20/0.52 (step t1 (cl (not (= (=> (forall ((X Int) (Y Int)) (not (= X (* X Y)))) (not (= 0 (* 0 0)))) (not (forall ((X Int) (Y Int)) (not (= X (* X Y))))))) (not (=> (forall ((X Int) (Y Int)) (not (= X (* X Y)))) (not (= 0 (* 0 0))))) (not (forall ((X Int) (Y Int)) (not (= X (* X Y)))))) :rule equiv_pos2)
% 0.20/0.52 (step t2 (cl (= (forall ((X Int) (Y Int)) (not (= X (* X Y)))) (forall ((X Int) (Y Int)) (not (= X (* X Y)))))) :rule refl)
% 0.20/0.52 (step t3 (cl (= 0 0)) :rule refl)
% 0.20/0.52 (step t4 (cl (= (* 0 0) 0)) :rule all_simplify)
% 0.20/0.52 (step t5 (cl (= (= 0 (* 0 0)) (= 0 0))) :rule cong :premises (t3 t4))
% 0.20/0.52 (step t6 (cl (= (= 0 0) true)) :rule all_simplify)
% 0.20/0.52 (step t7 (cl (= (= 0 (* 0 0)) true)) :rule trans :premises (t5 t6))
% 0.20/0.52 (step t8 (cl (= (not (= 0 (* 0 0))) (not true))) :rule cong :premises (t7))
% 0.20/0.52 (step t9 (cl (= (not true) false)) :rule all_simplify)
% 0.20/0.52 (step t10 (cl (= (not (= 0 (* 0 0))) false)) :rule trans :premises (t8 t9))
% 0.20/0.52 (step t11 (cl (= (=> (forall ((X Int) (Y Int)) (not (= X (* X Y)))) (not (= 0 (* 0 0)))) (=> (forall ((X Int) (Y Int)) (not (= X (* X Y)))) false))) :rule cong :premises (t2 t10))
% 0.20/0.52 (step t12 (cl (= (=> (forall ((X Int) (Y Int)) (not (= X (* X Y)))) false) (not (forall ((X Int) (Y Int)) (not (= X (* X Y))))))) :rule all_simplify)
% 0.20/0.52 (step t13 (cl (= (=> (forall ((X Int) (Y Int)) (not (= X (* X Y)))) (not (= 0 (* 0 0)))) (not (forall ((X Int) (Y Int)) (not (= X (* X Y))))))) :rule trans :premises (t11 t12))
% 0.20/0.52 (step t14 (cl (=> (forall ((X Int) (Y Int)) (not (= X (* X Y)))) (not (= 0 (* 0 0)))) (forall ((X Int) (Y Int)) (not (= X (* X Y))))) :rule implies_neg1)
% 0.20/0.52 (anchor :step t15)
% 0.20/0.52 (assume t15.a0 (forall ((X Int) (Y Int)) (not (= X (* X Y)))))
% 0.20/0.52 (step t15.t1 (cl (or (not (forall ((X Int) (Y Int)) (not (= X (* X Y))))) (not (= 0 (* 0 0))))) :rule forall_inst :args ((:= X 0) (:= Y 0)))
% 0.20/0.52 (step t15.t2 (cl (not (forall ((X Int) (Y Int)) (not (= X (* X Y))))) (not (= 0 (* 0 0)))) :rule or :premises (t15.t1))
% 0.20/0.52 (step t15.t3 (cl (not (= 0 (* 0 0)))) :rule resolution :premises (t15.t2 t15.a0))
% 0.20/0.52 (step t15 (cl (not (forall ((X Int) (Y Int)) (not (= X (* X Y))))) (not (= 0 (* 0 0)))) :rule subproof :discharge (t15.a0))
% 0.20/0.52 (step t16 (cl (=> (forall ((X Int) (Y Int)) (not (= X (* X Y)))) (not (= 0 (* 0 0)))) (not (= 0 (* 0 0)))) :rule resolution :premises (t14 t15))
% 0.20/0.52 (step t17 (cl (=> (forall ((X Int) (Y Int)) (not (= X (* X Y)))) (not (= 0 (* 0 0)))) (not (not (= 0 (* 0 0))))) :rule implies_neg2)
% 0.20/0.52 (step t18 (cl (=> (forall ((X Int) (Y Int)) (not (= X (* X Y)))) (not (= 0 (* 0 0)))) (=> (forall ((X Int) (Y Int)) (not (= X (* X Y)))) (not (= 0 (* 0 0))))) :rule resolution :premises (t16 t17))
% 0.20/0.52 (step t19 (cl (=> (forall ((X Int) (Y Int)) (not (= X (* X Y)))) (not (= 0 (* 0 0))))) :rule contraction :premises (t18))
% 0.20/0.52 (step t20 (cl (not (forall ((X Int) (Y Int)) (not (= X (* X Y)))))) :rule resolution :premises (t1 t13 t19))
% 0.20/0.52 (step t21 (cl (not (= (not (exists ((X Int) (Y Int)) (= (* X Y) X))) (forall ((X Int) (Y Int)) (not (= X (* X Y)))))) (not (not (exists ((X Int) (Y Int)) (= (* X Y) X)))) (forall ((X Int) (Y Int)) (not (= X (* X Y))))) :rule equiv_pos2)
% 0.20/0.52 (anchor :step t22 :args ((X Int) (:= X X) (Y Int) (:= Y Y)))
% 0.20/0.52 (step t22.t1 (cl (= X X)) :rule refl)
% 0.20/0.52 (step t22.t2 (cl (= Y Y)) :rule refl)
% 0.20/0.52 (step t22.t3 (cl (= (* X Y) (* X Y))) :rule all_simplify)
% 0.20/0.52 (step t22.t4 (cl (= X X)) :rule refl)
% 0.20/0.52 (step t22.t5 (cl (= (= (* X Y) X) (= (* X Y) X))) :rule cong :premises (t22.t3 t22.t4))
% 0.20/0.52 (step t22.t6 (cl (= (= (* X Y) X) (= X (* X Y)))) :rule all_simplify)
% 0.20/0.52 (step t22.t7 (cl (= (= (* X Y) X) (= X (* X Y)))) :rule trans :premises (t22.t5 t22.t6))
% 0.20/0.52 (step t22 (cl (= (exists ((X Int) (Y Int)) (= (* X Y) X)) (exists ((X Int) (Y Int)) (= X (* X Y))))) :rule bind)
% 0.20/0.52 (step t23 (cl (= (exists ((X Int) (Y Int)) (= X (* X Y))) (not (forall ((X Int) (Y Int)) (not (= X (* X Y))))))) :rule all_simplify)
% 0.20/0.52 (step t24 (cl (= (exists ((X Int) (Y Int)) (= (* X Y) X)) (not (forall ((X Int) (Y Int)) (not (= X (* X Y))))))) :rule trans :premises (t22 t23))
% 0.20/0.52 (step t25 (cl (= (not (exists ((X Int) (Y Int)) (= (* X Y) X))) (not (not (forall ((X Int) (Y Int)) (not (= X (* X Y)))))))) :rule cong :premises (t24))
% 0.20/0.52 (step t26 (cl (= (not (not (forall ((X Int) (Y Int)) (not (= X (* X Y)))))) (forall ((X Int) (Y Int)) (not (= X (* X Y)))))) :rule all_simplify)
% 0.20/0.52 (step t27 (cl (= (not (exists ((X Int) (Y Int)) (= (* X Y) X))) (forall ((X Int) (Y Int)) (not (= X (* X Y)))))) :rule trans :premises (t25 t26))
% 0.20/0.52 (step t28 (cl (forall ((X Int) (Y Int)) (not (= X (* X Y))))) :rule resolution :premises (t21 t27 a0))
% 0.20/0.52 (step t29 (cl) :rule resolution :premises (t20 t28))
% 0.20/0.52
% 0.20/0.52 % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.lxIAzjdyNa/cvc5---1.0.5_29328.smt2
% 0.20/0.52 % cvc5---1.0.5 exiting
% 0.20/0.53 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------