TSTP Solution File: ARI589_1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : ARI589_1 : TPTP v8.2.0. Released v5.1.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n018.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:11 EDT 2024
% Result : Theorem 0.20s 0.51s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : ARI589_1 : TPTP v8.2.0. Released v5.1.0.
% 0.11/0.13 % Command : do_cvc5 %s %d
% 0.13/0.35 % Computer : n018.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:24:39 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.49 %----Proving TF0_ARI
% 0.20/0.51 --- Run --finite-model-find --decision=internal at 15...
% 0.20/0.51 % SZS status Theorem for /export/starexec/sandbox2/tmp/tmp.RQYZygWusm/cvc5---1.0.5_471.smt2
% 0.20/0.51 % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.RQYZygWusm/cvc5---1.0.5_471.smt2
% 0.20/0.51 (assume a0 (not (forall ((Y Int) (Z Int)) (exists ((X Int)) (and (not (= Y X)) (not (= Z X)))))))
% 0.20/0.51 (assume a1 true)
% 0.20/0.51 (step t1 (cl (not (= (not (forall ((Y Int) (Z Int)) (exists ((X Int)) (and (not (= Y X)) (not (= Z X)))))) false)) (not (not (forall ((Y Int) (Z Int)) (exists ((X Int)) (and (not (= Y X)) (not (= Z X))))))) false) :rule equiv_pos2)
% 0.20/0.51 (anchor :step t2 :args ((Y Int) (:= Y Y) (Z Int) (:= Z Z)))
% 0.20/0.51 (step t2.t1 (cl (= Y Y)) :rule refl)
% 0.20/0.51 (step t2.t2 (cl (= Z Z)) :rule refl)
% 0.20/0.51 (step t2.t3 (cl (= (exists ((X Int)) (and (not (= Y X)) (not (= Z X)))) (not (forall ((X Int)) (not (and (not (= Y X)) (not (= Z X)))))))) :rule all_simplify)
% 0.20/0.51 (step t2.t4 (cl (= (forall ((X Int)) (not (and (not (= Y X)) (not (= Z X))))) (forall ((X Int)) (or (= Y X) (= Z X))))) :rule all_simplify)
% 0.20/0.51 (step t2.t5 (cl (= (forall ((X Int)) (or (= Y X) (= Z X))) (or false false))) :rule all_simplify)
% 0.20/0.51 (step t2.t6 (cl (= (or false false) false)) :rule all_simplify)
% 0.20/0.51 (step t2.t7 (cl (= (forall ((X Int)) (or (= Y X) (= Z X))) false)) :rule trans :premises (t2.t5 t2.t6))
% 0.20/0.51 (step t2.t8 (cl (= (forall ((X Int)) (not (and (not (= Y X)) (not (= Z X))))) false)) :rule trans :premises (t2.t4 t2.t7))
% 0.20/0.51 (step t2.t9 (cl (= (not (forall ((X Int)) (not (and (not (= Y X)) (not (= Z X)))))) (not false))) :rule cong :premises (t2.t8))
% 0.20/0.51 (step t2.t10 (cl (= (not false) true)) :rule all_simplify)
% 0.20/0.51 (step t2.t11 (cl (= (not (forall ((X Int)) (not (and (not (= Y X)) (not (= Z X)))))) true)) :rule trans :premises (t2.t9 t2.t10))
% 0.20/0.51 (step t2.t12 (cl (= (exists ((X Int)) (and (not (= Y X)) (not (= Z X)))) true)) :rule trans :premises (t2.t3 t2.t11))
% 0.20/0.51 (step t2 (cl (= (forall ((Y Int) (Z Int)) (exists ((X Int)) (and (not (= Y X)) (not (= Z X))))) (forall ((Y Int) (Z Int)) true))) :rule bind)
% 0.20/0.51 (step t3 (cl (= (forall ((Y Int) (Z Int)) true) true)) :rule all_simplify)
% 0.20/0.51 (step t4 (cl (= (forall ((Y Int) (Z Int)) (exists ((X Int)) (and (not (= Y X)) (not (= Z X))))) true)) :rule trans :premises (t2 t3))
% 0.20/0.51 (step t5 (cl (= (not (forall ((Y Int) (Z Int)) (exists ((X Int)) (and (not (= Y X)) (not (= Z X)))))) (not true))) :rule cong :premises (t4))
% 0.20/0.51 (step t6 (cl (= (not true) false)) :rule all_simplify)
% 0.20/0.51 (step t7 (cl (= (not (forall ((Y Int) (Z Int)) (exists ((X Int)) (and (not (= Y X)) (not (= Z X)))))) false)) :rule trans :premises (t5 t6))
% 0.20/0.51 (step t8 (cl false) :rule resolution :premises (t1 t7 a0))
% 0.20/0.51 (step t9 (cl (not false)) :rule false)
% 0.20/0.51 (step t10 (cl) :rule resolution :premises (t8 t9))
% 0.20/0.51
% 0.20/0.51 % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.RQYZygWusm/cvc5---1.0.5_471.smt2
% 0.20/0.51 % cvc5---1.0.5 exiting
% 0.20/0.51 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------