TSTP Solution File: SEU429+1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SEU429+1 : TPTP v8.1.2. Released v3.4.0.
% Transfm : none
% Format : tptp
% Command : do_cvc5 %s %d
% Computer : n004.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 : Thu Aug 31 16:31:40 EDT 2023
% Result : Theorem 0.19s 0.52s
% Output : Proof 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU429+1 : TPTP v8.1.2. Released v3.4.0.
% 0.00/0.14 % Command : do_cvc5 %s %d
% 0.13/0.34 % Computer : n004.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 : Thu Aug 24 00:01:53 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.19/0.48 %----Proving TF0_NAR, FOF, or CNF
% 0.19/0.52 ------- convert to smt2 : /export/starexec/sandbox/tmp/tmp.KsBT2DqfCj/cvc5---1.0.5_29387.p...
% 0.19/0.52 ------- get file name : TPTP file name is SEU429+1
% 0.19/0.52 ------- cvc5-fof : /export/starexec/sandbox/solver/bin/cvc5---1.0.5_29387.smt2...
% 0.19/0.52 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.19/0.52 % SZS status Theorem for SEU429+1
% 0.19/0.52 % SZS output start Proof for SEU429+1
% 0.19/0.52 (
% 0.19/0.52 (let ((_let_1 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (=> (and (not (tptp.v1_xboole_0 A)) (tptp.m1_subset_1 C (tptp.k1_zfmisc_1 (tptp.k1_zfmisc_1 A))) (tptp.m2_relset_1 D A B)) (tptp.m1_subset_1 (tptp.a_4_1_relset_2 A B C D) (tptp.k1_zfmisc_1 (tptp.k1_zfmisc_1 B))))))) (let ((_let_2 (tptp.v1_relat_1 tptp.k1_xboole_0))) (let ((_let_3 (tptp.v1_xboole_0 tptp.k1_xboole_0))) (let ((_let_4 (not (forall ((A $$unsorted)) (=> (not (tptp.v1_xboole_0 A)) (forall ((B $$unsorted) (C $$unsorted)) (=> (tptp.m1_subset_1 C (tptp.k1_zfmisc_1 (tptp.k1_zfmisc_1 A))) (forall ((D $$unsorted)) (=> (tptp.m2_relset_1 D A B) (tptp.m1_subset_1 (tptp.a_4_1_relset_2 A B C D) (tptp.k1_zfmisc_1 (tptp.k1_zfmisc_1 B)))))))))))) (let ((_let_5 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (tptp.v1_xboole_0 A) (not (tptp.m1_subset_1 C (tptp.k1_zfmisc_1 (tptp.k1_zfmisc_1 A)))) (not (tptp.m2_relset_1 D A B)) (tptp.m1_subset_1 (tptp.a_4_1_relset_2 A B C D) (tptp.k1_zfmisc_1 (tptp.k1_zfmisc_1 B))))))) (let ((_let_6 (forall ((A $$unsorted) (BOUND_VARIABLE_1085 $$unsorted) (BOUND_VARIABLE_1083 $$unsorted) (BOUND_VARIABLE_1081 $$unsorted)) (or (tptp.v1_xboole_0 A) (not (tptp.m1_subset_1 BOUND_VARIABLE_1083 (tptp.k1_zfmisc_1 (tptp.k1_zfmisc_1 A)))) (not (tptp.m2_relset_1 BOUND_VARIABLE_1085 A BOUND_VARIABLE_1081)) (tptp.m1_subset_1 (tptp.a_4_1_relset_2 A BOUND_VARIABLE_1081 BOUND_VARIABLE_1083 BOUND_VARIABLE_1085) (tptp.k1_zfmisc_1 (tptp.k1_zfmisc_1 BOUND_VARIABLE_1081))))))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (ASSUME :args (_let_1)) (MACRO_SR_EQ_INTRO :args (_let_1 SB_DEFAULT SBA_FIXPOINT))) (MACRO_RESOLUTION_TRUST (EQUIV_ELIM2 (THEORY_LEMMA :args ((= _let_6 _let_5) THEORY_QUANTIFIERS))) (EQ_RESOLVE (ASSUME :args (_let_4)) (MACRO_SR_EQ_INTRO :args (_let_4 SB_DEFAULT SBA_FIXPOINT))) :args ((not _let_5) true _let_6)) :args (false true _let_5)) :args (_let_4 (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.r2_hidden A B) (not (tptp.r2_hidden B A)))) (forall ((A $$unsorted)) (=> (tptp.v1_xboole_0 A) (tptp.v1_relat_1 A))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (=> (tptp.m1_subset_1 C (tptp.k1_zfmisc_1 (tptp.k2_zfmisc_1 A B))) (tptp.v1_relat_1 C))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (=> (tptp.m1_subset_1 C (tptp.k1_zfmisc_1 A)) (forall ((D $$unsorted)) (=> (tptp.m1_subset_1 D (tptp.k1_zfmisc_1 (tptp.k2_zfmisc_1 A B))) (= (tptp.k7_relset_2 A B C D) (tptp.k8_setfam_1 B (tptp.k4_relset_2 (tptp.k1_zfmisc_1 A) B (tptp.k6_relset_2 B A D) (tptp.k3_pua2mss1 C)))))))) true true true (forall ((A $$unsorted)) (tptp.m1_eqrel_1 (tptp.k3_pua2mss1 A) A)) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (let ((_let_1 (tptp.k1_zfmisc_1 B))) (=> (tptp.m1_subset_1 C (tptp.k1_zfmisc_1 (tptp.k2_zfmisc_1 A _let_1))) (tptp.m1_subset_1 (tptp.k4_relset_2 A B C D) (tptp.k1_zfmisc_1 _let_1))))) (forall ((A $$unsorted) (B $$unsorted)) (let ((_let_1 (tptp.k5_relset_2 A B))) (=> (tptp.v1_relat_1 B) (and (tptp.v1_relat_1 _let_1) (tptp.v1_funct_1 _let_1))))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (let ((_let_1 (tptp.k1_zfmisc_1 A))) (let ((_let_2 (tptp.k1_zfmisc_1 B))) (let ((_let_3 (tptp.k6_relset_2 A B C))) (=> (tptp.m1_subset_1 C (tptp.k1_zfmisc_1 (tptp.k2_zfmisc_1 B A))) (and (tptp.v1_funct_1 _let_3) (tptp.v1_funct_2 _let_3 _let_2 _let_1) (tptp.m2_relset_1 _let_3 _let_2 _let_1))))))) true (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (=> (and (tptp.m1_subset_1 C (tptp.k1_zfmisc_1 A)) (tptp.m1_subset_1 D (tptp.k1_zfmisc_1 (tptp.k2_zfmisc_1 A B)))) (tptp.m1_subset_1 (tptp.k8_relset_2 A B C D) (tptp.k1_zfmisc_1 B)))) (forall ((A $$unsorted) (B $$unsorted)) (let ((_let_1 (tptp.k1_zfmisc_1 A))) (=> (tptp.m1_subset_1 B (tptp.k1_zfmisc_1 _let_1)) (tptp.m1_subset_1 (tptp.k8_setfam_1 A B) _let_1)))) true (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.m1_eqrel_1 B A) (tptp.m1_subset_1 B (tptp.k1_zfmisc_1 (tptp.k1_zfmisc_1 A))))) true true (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (=> (tptp.m2_relset_1 C A B) (tptp.m1_subset_1 C (tptp.k1_zfmisc_1 (tptp.k2_zfmisc_1 A B))))) (forall ((A $$unsorted)) (exists ((B $$unsorted)) (tptp.m1_eqrel_1 B A))) (forall ((A $$unsorted) (B $$unsorted)) (exists ((C $$unsorted)) (tptp.m1_relset_1 C A B))) (forall ((A $$unsorted)) (exists ((B $$unsorted)) (tptp.m1_subset_1 B A))) (forall ((A $$unsorted) (B $$unsorted)) (exists ((C $$unsorted)) (tptp.m2_relset_1 C A B))) (and _let_3 _let_2 (tptp.v3_relat_1 tptp.k1_xboole_0)) (forall ((A $$unsorted)) (not (tptp.v1_xboole_0 (tptp.k1_zfmisc_1 A)))) (forall ((A $$unsorted) (B $$unsorted)) (tptp.v1_relat_1 (tptp.k2_zfmisc_1 A B))) (and _let_3 _let_2) (forall ((A $$unsorted) (B $$unsorted)) (=> (and (not (tptp.v1_xboole_0 A)) (not (tptp.v1_xboole_0 B))) (not (tptp.v1_xboole_0 (tptp.k2_zfmisc_1 A B))))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted)) (=> (and (not (tptp.v1_xboole_0 B)) (tptp.m1_subset_1 D (tptp.k1_zfmisc_1 (tptp.k1_zfmisc_1 B))) (tptp.m2_relset_1 E B C)) (= (tptp.r2_hidden A (tptp.a_4_1_relset_2 B C D E)) (exists ((F $$unsorted)) (and (tptp.m1_subset_1 F (tptp.k1_zfmisc_1 B)) (= A (tptp.k8_relset_2 B C F E)) (tptp.r2_hidden F D)))))) (exists ((A $$unsorted)) (and (tptp.v1_xboole_0 A) (tptp.v1_relat_1 A))) (forall ((A $$unsorted)) (=> (not (tptp.v1_xboole_0 A)) (exists ((B $$unsorted)) (and (tptp.m1_subset_1 B (tptp.k1_zfmisc_1 A)) (not (tptp.v1_xboole_0 B)))))) (forall ((A $$unsorted) (B $$unsorted)) (exists ((C $$unsorted)) (and (tptp.m1_relset_1 C A B) (tptp.v1_relat_1 C) (tptp.v1_funct_1 C)))) (exists ((A $$unsorted)) (and (not (tptp.v1_xboole_0 A)) (tptp.v1_relat_1 A))) (forall ((A $$unsorted)) (exists ((B $$unsorted)) (and (tptp.m1_subset_1 B (tptp.k1_zfmisc_1 A)) (tptp.v1_xboole_0 B)))) (exists ((A $$unsorted)) (and (tptp.v1_relat_1 A) (tptp.v3_relat_1 A))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (=> (tptp.m1_subset_1 C (tptp.k1_zfmisc_1 (tptp.k2_zfmisc_1 A (tptp.k1_zfmisc_1 B)))) (= (tptp.k4_relset_2 A B C D) (tptp.k9_relat_1 C D)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (=> (tptp.m1_subset_1 C (tptp.k1_zfmisc_1 (tptp.k2_zfmisc_1 B A))) (= (tptp.k6_relset_2 A B C) (tptp.k5_relset_2 B C)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (=> (and (tptp.m1_subset_1 C (tptp.k1_zfmisc_1 A)) (tptp.m1_subset_1 D (tptp.k1_zfmisc_1 (tptp.k2_zfmisc_1 A B)))) (= (tptp.k8_relset_2 A B C D) (tptp.k7_relset_2 A B C D)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (= (tptp.m2_relset_1 C A B) (tptp.m1_relset_1 C A B))) (forall ((A $$unsorted) (B $$unsorted)) (tptp.r1_tarski A A)) _let_1 (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.r2_hidden A B) (tptp.m1_subset_1 A B))) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.m1_subset_1 A B) (or (tptp.v1_xboole_0 B) (tptp.r2_hidden A B)))) (forall ((A $$unsorted) (B $$unsorted)) (=> (forall ((C $$unsorted)) (= (tptp.r2_hidden C A) (tptp.r2_hidden C B))) (= A B))) (forall ((A $$unsorted) (B $$unsorted)) (= (tptp.m1_subset_1 A (tptp.k1_zfmisc_1 B)) (tptp.r1_tarski A B))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (=> (and (tptp.r2_hidden A B) (tptp.m1_subset_1 B (tptp.k1_zfmisc_1 C))) (tptp.m1_subset_1 A C))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (not (and (tptp.r2_hidden A B) (tptp.m1_subset_1 B (tptp.k1_zfmisc_1 C)) (tptp.v1_xboole_0 C)))) (forall ((A $$unsorted)) (=> (tptp.v1_xboole_0 A) (= A tptp.k1_xboole_0))) (forall ((A $$unsorted) (B $$unsorted)) (not (and (tptp.r2_hidden A B) (tptp.v1_xboole_0 B)))) (forall ((A $$unsorted) (B $$unsorted)) (not (and (tptp.v1_xboole_0 A) (not (= A B)) (tptp.v1_xboole_0 B)))) true)))))))))
% 0.19/0.52 )
% 0.19/0.52 % SZS output end Proof for SEU429+1
% 0.19/0.53 % cvc5---1.0.5 exiting
% 0.19/0.53 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------