TSTP Solution File: SEU314+1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SEU314+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : do_cvc5 %s %d
% Computer : n017.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:30:50 EDT 2023
% Result : Theorem 0.20s 0.53s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SEU314+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.14 % Command : do_cvc5 %s %d
% 0.13/0.35 % Computer : n017.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 : Wed Aug 23 21:20:24 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.49 %----Proving TF0_NAR, FOF, or CNF
% 0.20/0.53 ------- convert to smt2 : /export/starexec/sandbox2/tmp/tmp.6C30rGzCC2/cvc5---1.0.5_9540.p...
% 0.20/0.53 ------- get file name : TPTP file name is SEU314+1
% 0.20/0.53 ------- cvc5-fof : /export/starexec/sandbox2/solver/bin/cvc5---1.0.5_9540.smt2...
% 0.20/0.53 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.20/0.53 % SZS status Theorem for SEU314+1
% 0.20/0.53 % SZS output start Proof for SEU314+1
% 0.20/0.53 (
% 0.20/0.53 (let ((_let_1 (forall ((A $$unsorted) (B $$unsorted)) (=> (and (tptp.topological_space A) (tptp.top_str A) (tptp.element B (tptp.powerset (tptp.the_carrier A)))) (=> (forall ((C $$unsorted) (D $$unsorted) (E $$unsorted)) (=> (and (= C D) (exists ((F $$unsorted)) (and (tptp.element F (tptp.powerset (tptp.the_carrier A))) (= F D) (tptp.closed_subset F A) (tptp.subset B D))) (= C E) (exists ((G $$unsorted)) (and (tptp.element G (tptp.powerset (tptp.the_carrier A))) (= G E) (tptp.closed_subset G A) (tptp.subset B E)))) (= D E))) (exists ((C $$unsorted)) (forall ((D $$unsorted)) (= (tptp.in D C) (exists ((E $$unsorted)) (and (tptp.in E (tptp.powerset (tptp.the_carrier A))) (= E D) (exists ((H $$unsorted)) (and (tptp.element H (tptp.powerset (tptp.the_carrier A))) (= H D) (tptp.closed_subset H A) (tptp.subset B D))))))))))))) (let ((_let_2 (not (forall ((A $$unsorted) (B $$unsorted)) (=> (and (tptp.topological_space A) (tptp.top_str A) (tptp.element B (tptp.powerset (tptp.the_carrier A)))) (exists ((C $$unsorted)) (forall ((D $$unsorted)) (= (tptp.in D C) (and (tptp.in D (tptp.powerset (tptp.the_carrier A))) (exists ((E $$unsorted)) (and (tptp.element E (tptp.powerset (tptp.the_carrier A))) (= E D) (tptp.closed_subset E A) (tptp.subset B D)))))))))))) (let ((_let_3 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.topological_space A)) (not (tptp.top_str A)) (not (tptp.element B (tptp.powerset (tptp.the_carrier A)))) (not (forall ((C $$unsorted)) (not (forall ((D $$unsorted)) (let ((_let_1 (tptp.powerset (tptp.the_carrier A)))) (= (tptp.in D C) (and (tptp.subset B D) (tptp.element D _let_1) (tptp.closed_subset D A) (tptp.in D _let_1)))))))))))) (let ((_let_4 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.topological_space A)) (not (tptp.top_str A)) (not (tptp.element B (tptp.powerset (tptp.the_carrier A)))) (not (forall ((C $$unsorted)) (not (forall ((D $$unsorted)) (let ((_let_1 (tptp.powerset (tptp.the_carrier A)))) (= (tptp.in D C) (and (tptp.in D _let_1) (tptp.subset B D) (tptp.element D _let_1) (tptp.closed_subset D A)))))))))))) (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 (TRANS (ALPHA_EQUIV :args (_let_4 (= A A) (= B B) (= C C) (= D D))) (MACRO_SR_PRED_INTRO :args ((= (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.topological_space A)) (not (tptp.top_str A)) (not (tptp.element B (tptp.powerset (tptp.the_carrier A)))) (not (forall ((C $$unsorted)) (not (forall ((D $$unsorted)) (let ((_let_1 (tptp.powerset (tptp.the_carrier A)))) (= (tptp.in D C) (and (tptp.in D _let_1) (tptp.subset B D) (tptp.element D _let_1) (tptp.closed_subset D A)))))))))) _let_3) SB_DEFAULT SBA_SEQUENTIAL RW_EXT_REWRITE)))) (EQ_RESOLVE (ASSUME :args (_let_2)) (MACRO_SR_EQ_INTRO :args (_let_2 SB_DEFAULT SBA_FIXPOINT))) :args ((not _let_3) true _let_4)) :args (false true _let_3)) :args (_let_2 (forall ((A $$unsorted)) (=> (tptp.v5_membered A) (tptp.v4_membered A))) (forall ((A $$unsorted)) (=> (tptp.v4_membered A) (tptp.v3_membered A))) (forall ((A $$unsorted)) (=> (tptp.v3_membered A) (tptp.v2_membered A))) (forall ((A $$unsorted)) (=> (tptp.v2_membered A) (tptp.v1_membered A))) (exists ((A $$unsorted)) (and (not (tptp.empty A)) (tptp.v1_membered A) (tptp.v2_membered A) (tptp.v3_membered A) (tptp.v4_membered A) (tptp.v5_membered A))) (forall ((A $$unsorted)) (=> (tptp.v1_membered A) (forall ((B $$unsorted)) (=> (tptp.element B A) (tptp.v1_xcmplx_0 B))))) (forall ((A $$unsorted)) (=> (tptp.v2_membered A) (forall ((B $$unsorted)) (=> (tptp.element B A) (and (tptp.v1_xcmplx_0 B) (tptp.v1_xreal_0 B)))))) (forall ((A $$unsorted)) (=> (tptp.v3_membered A) (forall ((B $$unsorted)) (=> (tptp.element B A) (and (tptp.v1_xcmplx_0 B) (tptp.v1_xreal_0 B) (tptp.v1_rat_1 B)))))) (forall ((A $$unsorted)) (=> (tptp.v4_membered A) (forall ((B $$unsorted)) (=> (tptp.element B A) (and (tptp.v1_xcmplx_0 B) (tptp.v1_xreal_0 B) (tptp.v1_int_1 B) (tptp.v1_rat_1 B)))))) (forall ((A $$unsorted)) (=> (tptp.v5_membered A) (forall ((B $$unsorted)) (=> (tptp.element B A) (and (tptp.v1_xcmplx_0 B) (tptp.natural B) (tptp.v1_xreal_0 B) (tptp.v1_int_1 B) (tptp.v1_rat_1 B)))))) (forall ((A $$unsorted)) (=> (tptp.v1_membered A) (forall ((B $$unsorted)) (=> (tptp.element B (tptp.powerset A)) (tptp.v1_membered B))))) (forall ((A $$unsorted)) (=> (tptp.v2_membered A) (forall ((B $$unsorted)) (=> (tptp.element B (tptp.powerset A)) (and (tptp.v1_membered B) (tptp.v2_membered B)))))) (forall ((A $$unsorted)) (=> (tptp.v3_membered A) (forall ((B $$unsorted)) (=> (tptp.element B (tptp.powerset A)) (and (tptp.v1_membered B) (tptp.v2_membered B) (tptp.v3_membered B)))))) (forall ((A $$unsorted)) (=> (tptp.v4_membered A) (forall ((B $$unsorted)) (=> (tptp.element B (tptp.powerset A)) (and (tptp.v1_membered B) (tptp.v2_membered B) (tptp.v3_membered B) (tptp.v4_membered B)))))) (forall ((A $$unsorted)) (=> (tptp.v5_membered A) (forall ((B $$unsorted)) (=> (tptp.element B (tptp.powerset A)) (and (tptp.v1_membered B) (tptp.v2_membered B) (tptp.v3_membered B) (tptp.v4_membered B) (tptp.v5_membered B)))))) true (forall ((A $$unsorted)) (=> (not (tptp.empty A)) (exists ((B $$unsorted)) (and (tptp.element B (tptp.powerset A)) (not (tptp.empty B)))))) (forall ((A $$unsorted)) (exists ((B $$unsorted)) (and (tptp.element B (tptp.powerset A)) (tptp.empty B)))) (forall ((A $$unsorted)) (=> (tptp.empty A) (and (tptp.v1_membered A) (tptp.v2_membered A) (tptp.v3_membered A) (tptp.v4_membered A) (tptp.v5_membered A)))) (forall ((A $$unsorted) (B $$unsorted)) (tptp.subset A A)) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.in A B) (not (tptp.in B A)))) true (forall ((A $$unsorted)) (=> (tptp.top_str A) (tptp.one_sorted_str A))) true true (forall ((A $$unsorted)) (=> (and (tptp.topological_space A) (tptp.top_str A)) (exists ((B $$unsorted)) (and (tptp.element B (tptp.powerset (tptp.the_carrier A))) (tptp.closed_subset B A))))) (forall ((A $$unsorted)) (not (tptp.empty (tptp.powerset A)))) _let_1 true)))))))
% 0.20/0.53 )
% 0.20/0.53 % SZS output end Proof for SEU314+1
% 0.20/0.53 % cvc5---1.0.5 exiting
% 0.20/0.54 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------