TSTP Solution File: SEU332+1 by cvc5---1.0.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : cvc5---1.0.5
% Problem  : SEU332+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm  : none
% Format   : tptp
% Command  : do_cvc5 %s %d

% Computer : n020.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:58 EDT 2023

% 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.00/0.12  % Problem    : SEU332+1 : TPTP v8.1.2. Released v3.3.0.
% 0.13/0.14  % Command    : do_cvc5 %s %d
% 0.13/0.34  % Computer : n020.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   : Wed Aug 23 14:21:30 EDT 2023
% 0.13/0.35  % CPUTime    : 
% 0.20/0.47  %----Proving TF0_NAR, FOF, or CNF
% 0.20/0.52  ------- convert to smt2 : /export/starexec/sandbox/tmp/tmp.mZ6AnZKBLB/cvc5---1.0.5_31157.p...
% 0.20/0.52  ------- get file name : TPTP file name is SEU332+1
% 0.20/0.52  ------- cvc5-fof : /export/starexec/sandbox/solver/bin/cvc5---1.0.5_31157.smt2...
% 0.20/0.52  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.20/0.52  % SZS status Theorem for SEU332+1
% 0.20/0.52  % SZS output start Proof for SEU332+1
% 0.20/0.52  (
% 0.20/0.52  (let ((_let_1 (forall ((A $$unsorted) (B $$unsorted)) (=> (and (tptp.one_sorted_str A) (tptp.element B (tptp.powerset (tptp.powerset (tptp.the_carrier A))))) (forall ((C $$unsorted)) (=> (forall ((D $$unsorted) (E $$unsorted) (F $$unsorted)) (=> (and (= D E) (exists ((G $$unsorted) (H $$unsorted)) (and (= (tptp.ordered_pair G H) E) (tptp.in G B) (forall ((I $$unsorted)) (let ((_let_1 (tptp.the_carrier A))) (=> (tptp.element I (tptp.powerset _let_1)) (=> (= I G) (= H (tptp.subset_complement _let_1 I)))))))) (= D F) (exists ((J $$unsorted) (K $$unsorted)) (and (= (tptp.ordered_pair J K) F) (tptp.in J B) (forall ((L $$unsorted)) (let ((_let_1 (tptp.the_carrier A))) (=> (tptp.element L (tptp.powerset _let_1)) (=> (= L J) (= K (tptp.subset_complement _let_1 L))))))))) (= E F))) (exists ((D $$unsorted)) (forall ((E $$unsorted)) (= (tptp.in E D) (exists ((F $$unsorted)) (and (tptp.in F (tptp.cartesian_product2 B C)) (= F E) (exists ((M $$unsorted) (N $$unsorted)) (and (= (tptp.ordered_pair M N) E) (tptp.in M B) (forall ((O $$unsorted)) (let ((_let_1 (tptp.the_carrier A))) (=> (tptp.element O (tptp.powerset _let_1)) (=> (= O M) (= N (tptp.subset_complement _let_1 O))))))))))))))))))) (let ((_let_2 (not (forall ((A $$unsorted) (B $$unsorted)) (=> (and (tptp.one_sorted_str A) (tptp.element B (tptp.powerset (tptp.powerset (tptp.the_carrier A))))) (forall ((C $$unsorted)) (exists ((D $$unsorted)) (forall ((E $$unsorted)) (= (tptp.in E D) (and (tptp.in E (tptp.cartesian_product2 B C)) (exists ((F $$unsorted) (G $$unsorted)) (and (= (tptp.ordered_pair F G) E) (tptp.in F B) (forall ((H $$unsorted)) (let ((_let_1 (tptp.the_carrier A))) (=> (tptp.element H (tptp.powerset _let_1)) (=> (= H F) (= G (tptp.subset_complement _let_1 H)))))))))))))))))) (let ((_let_3 (forall ((A $$unsorted) (B $$unsorted) (BOUND_VARIABLE_1567 $$unsorted)) (or (not (tptp.one_sorted_str A)) (not (tptp.element B (tptp.powerset (tptp.powerset (tptp.the_carrier A))))) (not (forall ((D $$unsorted)) (not (forall ((E $$unsorted)) (= (tptp.in E D) (and (not (forall ((M $$unsorted) (N $$unsorted)) (let ((_let_1 (tptp.the_carrier A))) (or (not (= E (tptp.ordered_pair M N))) (not (tptp.in M B)) (and (tptp.element M (tptp.powerset _let_1)) (not (= N (tptp.subset_complement _let_1 M)))))))) (tptp.in E (tptp.cartesian_product2 B BOUND_VARIABLE_1567)))))))))))) (let ((_let_4 (forall ((A $$unsorted) (B $$unsorted) (BOUND_VARIABLE_1048 $$unsorted)) (or (not (tptp.one_sorted_str A)) (not (tptp.element B (tptp.powerset (tptp.powerset (tptp.the_carrier A))))) (not (forall ((D $$unsorted)) (not (forall ((E $$unsorted)) (= (tptp.in E D) (and (tptp.in E (tptp.cartesian_product2 B BOUND_VARIABLE_1048)) (not (forall ((F $$unsorted) (G $$unsorted)) (let ((_let_1 (tptp.the_carrier A))) (or (not (= E (tptp.ordered_pair F G))) (not (tptp.in F B)) (and (tptp.element F (tptp.powerset _let_1)) (not (= G (tptp.subset_complement _let_1 F)))))))))))))))))) (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 (= B B) (= A A) (= D D) (= E E) (= BOUND_VARIABLE_1048 BOUND_VARIABLE_1567) (= F M) (= G N))) (MACRO_SR_PRED_INTRO :args ((= (forall ((A $$unsorted) (B $$unsorted) (BOUND_VARIABLE_1567 $$unsorted)) (or (not (tptp.one_sorted_str A)) (not (tptp.element B (tptp.powerset (tptp.powerset (tptp.the_carrier A))))) (not (forall ((D $$unsorted)) (not (forall ((E $$unsorted)) (= (tptp.in E D) (and (tptp.in E (tptp.cartesian_product2 B BOUND_VARIABLE_1567)) (not (forall ((M $$unsorted) (N $$unsorted)) (let ((_let_1 (tptp.the_carrier A))) (or (not (= E (tptp.ordered_pair M N))) (not (tptp.in M B)) (and (tptp.element M (tptp.powerset _let_1)) (not (= N (tptp.subset_complement _let_1 M)))))))))))))))) _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)))))) (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)) (=> (not (tptp.empty A)) (exists ((B $$unsorted)) (and (tptp.element B (tptp.powerset A)) (not (tptp.empty B)))))) (forall ((A $$unsorted) (B $$unsorted)) (=> (and (not (tptp.empty A)) (not (tptp.empty B))) (not (tptp.empty (tptp.cartesian_product2 A B))))) (forall ((A $$unsorted)) (exists ((B $$unsorted)) (and (tptp.element B (tptp.powerset A)) (tptp.empty B)))) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.element B (tptp.powerset A)) (= (tptp.subset_complement A (tptp.subset_complement A B)) B))) (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.in A B) (not (tptp.in B A)))) true true (forall ((A $$unsorted) (B $$unsorted)) (let ((_let_1 (tptp.powerset A))) (=> (tptp.element B _let_1) (tptp.element (tptp.subset_complement A B) _let_1)))) true true true true (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (=> (tptp.element C (tptp.powerset (tptp.cartesian_product2 A B))) (tptp.relation C))) (forall ((A $$unsorted)) (not (tptp.empty (tptp.powerset A)))) _let_1 true)))))))
% 0.20/0.52  )
% 0.20/0.52  % SZS output end Proof for SEU332+1
% 0.20/0.52  % cvc5---1.0.5 exiting
% 0.20/0.53  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------